Accepted papers
print
- Dávid Angyal and Benedek Nagy. On Linear Grammars with Exact Control
- József Békési and Gábor Galambos. Tight Online Bin Packing Algorithm with Buffer and Parametric Item Sizes
- Kristof Berczi, Zoltan Kiraly, Changshuo Liu and István Miklós. Packing tree degree sequences
- Andrej Brodnik, Vladan Jovičić, Marko Palangetić and Daniel Silađi. Construction of orthogonal CC-set
- Bela Csaba and Balint Vasarhelyi. On embedding degree sequences
- Csongor Gy. Csehi, Márk Farkas and Ádám Tóth. A self-bounding Branch & Bound procedure for truck routing and scheduling
- Balázs Dávid. Schedule assignment for vehicles in inter-city bus transportation over a planning period
- Matjaz Depolli, Janez Konc, Sandor Szabo and Bogdan Zavalnij. Usage of hereditary colorings of product graphs in clique search programs
- Tomaž Dobravec. ALGator - An Automatic Algorithm Evaluation System
- Pál Dömösi, József Gáll, Géza Horváth and Norbert Tihanyi. ON NIST test of a Novel Cryptosystem Based on Automata Compositions
- Gyorgy Dosa, Hans Kellerer and Zsolt Tuza. Team Work Scheduling
- Elena Fernández, Gilbert Laporte and Jessica Rodríguez Pereira. A Branch-and-Cut Algorithm for the Multi-Depot Rural Postman Problem
- Imre Gera, Balázs Bánhelyi and András London. Testing the Markowitz Portfolio Optimization Method with Filtered Correlation Matrices
- Dries Goossens, Bart Vangerven and Frits Spieksma. Computational complexity of the winner determination problem for geometrical combinatorial auctions
- Lajos Győrffy, András London and Géza Makay. A Graph to the Pairing strategies of the 9-in-a-row Game
- Ervin Gyori and Tamas Mezei. Partitioning polyominoes into polyominoes of at most 8 vertices, mobile vs. point guards
- Zsolt Mihály and Zoltán Lelkes. Improving flow lines by unbalance
- Jurij Mihelič, Uroš Čibej and Luka Fürst. Exploratory Equivalence on Hypercube Graphs
- Dezso Miklos and Gyula Y. Katona. The vertex sign balance of (hyper)graphs
- István Miklós and Adrienn Szabó. Diploid Genome Rearrangement
- Saša Pekeč. Allocation and Pricing on a Network in Presence of Negative Externalities
- David Podgorelec and Denis Špelič. Incremental 2-D nearest-point search with evenly populated strips
- Petrus H. Potgieter. Some computable functions without Brouwer fixed-points
- Milos Subotic, Laszlo Palfi and Nebojsa Pjevalica. Customizing Hybrid Optimization for Microwave Tomography
- Sandor Szabo and Bogdan Zavalnij. Benchmark problems for exhaustive exact maximum clique search algorithms
- Nándor Vincze, Zsolt Ercsey and Zoltán Kovács. Process Network Solution of a Soleplate Manufacturer's Extended CPM Problem with Alternatives