News Connections For Students

Publications

Bibliometric Overview

Journal Venue Analysis: According to the Danish Bibliometric Research Indicator, the best 20% of venues are categorized as "Level 2". As indicated, we publish a far larger percentage in the top venues. For each venue, the ministry's latest bibliometric category is used. Conference publications are not included.

Publication List

We list publications by members of the group independent of the exact area for the work. We do not list publications by affiliated or emeriti members. For each year, journal articles are listed before conference papers, and in each category, papers are listed alphabetically by authors' last names.

Acknowledgement: We are grateful to dblp (2018-12-07) for providing data for the publication list.


2018

Continuous Yao graphs.
Davood Bakhshesh, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, Mohammad Farshi, André van Renssen, Perouz Taslakian, Sander Verdonschot.
Comput. Geom. 67: 42-52, 2018.

Completing orientations of partially oriented graphs.
Jørgen Bang-Jensen, Jing Huang, Xuding Zhu.
Journal of Graph Theory 87(3): 285-304, 2018.

Out-degree reducing partitions of digraphs.
Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo.
Theor. Comput. Sci. 719: 64-72, 2018.

Degree constrained 2-partitions of semicomplete digraphs.
Jørgen Bang-Jensen, Tilde My Christiansen.
Theor. Comput. Sci. 746: 112-123, 2018.

Batch Coloring of Graphs.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin.
Algorithmica 80(11): 3293-3315, 2018.

Online-bounded analysis.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin.
J. Scheduling 21(4): 429-441, 2018.

Weighted Online Problems with Advice.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen.
Theory Comput. Syst. 62(6): 1443-1469, 2018.

Multiplicative complexity of vector valued Boolean functions.
Joan Boyar, Magnus Gausdal Find.
Theor. Comput. Sci. 720: 36-46, 2018.

Adding isolated vertices makes some greedy online algorithms optimal.
Joan Boyar, Christian Kudahl.
Discrete Applied Mathematics 246: 12-21, 2018.

Finding the K best synthesis plans.
Rolf Fagerberg, Christoph Flamm, Rojin Kianian, Daniel Merkle, Peter F. Stadler.
J. Cheminformatics 10(1): 19:1-19:21, 2018.

Online edge coloring of paths and trees with a fixed number of colors.
Lene M. Favrholdt, Jesper W. Mikkelsen.
Acta Inf. 55(1): 57-80, 2018.

DNA-templated synthesis optimization.
Bjarke N. Hansen, Kim S. Larsen, Daniel Merkle, Alexei Mihalchuk.
Natural Computing 17(4): 693-707, 2018.

On Upper Transversals in 3-Uniform Hypergraphs.
Michael A. Henning, Anders Yeo.
Electr. J. Comb. 25(4): P4.27, 2018.

Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs.
Michael A. Henning, Anders Yeo.
Discrete Mathematics 341(8): 2285-2292, 2018.

Time-consistent reconciliation maps and forbidden time travel.
Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth.
Algorithms for Molecular Biology 13(1): 2:1-2:17, 2018.

A Brooks Type Theorem for the Maximum Local Edge Connectivity.
Michael Stiebitz, Bjarne Toft.
Electr. J. Comb. 25(1): P1.50, 2018.

A Generic Framework for Engineering Graph Canonization Algorithms.
Jakob L. Andersen, Daniel Merkle.
ALENEX: 139-153, SIAM, 2018.
[Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018..]

Parameterized Algorithms for Survivable Network Design with Uniform Demands.
Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi.
SODA: 2838-2850, SIAM, 2018.
[Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018.]

Advice Complexity of Priority Algorithms.
Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov.
WAOA, Lecture Notes in Computer Science 11312: 69-86, Springer, 2018.
[Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers.]

Relative Worst-Order Analysis: A Survey.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen.
Adventures Between Lower Bounds and Higher Altitudes, Lecture Notes in Computer Science 11011: 216-230, Springer, 2018.
[Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday.]

Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings.
Marc Hellmuth, Anders S. Knudsen, Michal Kotrbcík, Daniel Merkle, Nikolai Nøjgaard.
ALENEX: 154-168, SIAM, 2018.
[Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018..]

Heuristic Variants of A* Search for 3D Flight Planning.
Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen.
CPAIOR, Lecture Notes in Computer Science 10848: 361-376, Springer, 2018.
[Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 15th International Conference, CPAIOR 2018, Delft, The Netherlands, June 26-29, 2018, Proceedings.]

Partial Homology Relations - Satisfiability in Terms of Di-Cographs.
Nikolai Nøjgaard, Nadia El-Mabrouk, Daniel Merkle, Nicolas Wieseke, Marc Hellmuth.
COCOON, Lecture Notes in Computer Science 10976: 403-415, Springer, 2018.
[Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings.]


2017

Antistrong digraphs.
Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell.
J. Comb. Theory, Ser. B 122: 68-90, 2017.

Disjoint Paths in Decomposable Digraphs.
Jørgen Bang-Jensen, Tilde My Christiansen, Alessandro Maddaloni.
Journal of Graph Theory 85(2): 545-567, 2017.

Competitive local routing with constraints.
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot.
JoCG 8(1): 125-152, 2017.

Online Algorithms with Advice: A Survey.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen.
ACM Comput. Surv. 50(2): 19:1-19:34, 2017.

The Advice Complexity of a Class of Hard Online Problems.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen.
Theory Comput. Syst. 61(4): 1128-1177, 2017.

On the list update problem with advice.
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz.
Inf. Comput. 253: 411-423, 2017.

On interval and cyclic interval edge colorings of (3, 5)-biregular graphs.
Carl Johan Casselgren, Petros A. Petrosyan, Bjarne Toft.
Discrete Mathematics 340(11): 2678-2687, 2017.

Formally Proving Size Optimality of Sorting Networks.
Luís Cruz-Filipe, Kim S. Larsen, Peter Schneider-Kamp.
J. Autom. Reasoning 59(4): 425-454, 2017.

Graphical coprime walk algorithm for structural controllability of discrete-time rank-one bilinear systems.
Supratim Ghosh, Justin Ruths, Anders Yeo.
Automatica 86: 166-173, 2017.

Chinese Postman Problem on edge-colored multigraphs.
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo.
Discrete Applied Mathematics 217: 196-202, 2017.

Acyclicity in edge-colored graphs.
Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo.
Discrete Mathematics 340(2): 1-8, 2017.

Rural postman parameterized by the number of components of required edges.
Gregory Z. Gutin, Magnus Wahlström, Anders Yeo.
J. Comput. Syst. Sci. 83(1): 121-131, 2017.

Note on Perfect Forests in Digraphs.
Gregory Z. Gutin, Anders Yeo.
Journal of Graph Theory 85(2): 372-377, 2017.

Transversals and Independence in Linear Hypergraphs with Maximum Degree Two.
Michael A. Henning, Anders Yeo.
Electr. J. Comb. 24(2): P2.50, 2017.

A note on fractional disjoint transversals in hypergraphs.
Michael A. Henning, Anders Yeo.
Discrete Mathematics 340(10): 2349-2354, 2017.

Chemical Graph Transformation with Stereo-Information.
Jakob Lykke Andersen, Christoph Flamm, Daniel Merkle, Peter F. Stadler.
ICGT, Lecture Notes in Computer Science 10373: 54-69, Springer, 2017.
[Graph Transformation - 10th International Conference, ICGT 2017, Held as Part of STAF 2017, Marburg, Germany, July 18-19, 2017, Proceedings.]

Relaxing the Irrevocability Requirement for Online Graph Algorithms.
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen.
WADS, Lecture Notes in Computer Science 10389: 217-228, Springer, 2017.
[Algorithms and Data Structures - 15th International Symposium, WADS 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings.]

The Paths to Choreography Extraction.
Luís Cruz-Filipe, Kim S. Larsen, Fabrizio Montesi.
FoSSaCS, Lecture Notes in Computer Science 10203: 424-440, 2017.
[Foundations of Software Science and Computation Structures - 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings.]

How to Get More Out of Your Oracles.
Luís Cruz-Filipe, Kim S. Larsen, Peter Schneider-Kamp.
ITP, Lecture Notes in Computer Science 10499: 164-170, Springer, 2017.
[Interactive Theorem Proving - 8th International Conference, ITP 2017, Brasília, Brazil, September 26-29, 2017, Proceedings.]

DNA-Templated Synthesis Optimization.
Bjarke N. Hansen, Kim S. Larsen, Daniel Merkle, Alexei Mihalchuk.
DNA, Lecture Notes in Computer Science 10467: 17-32, Springer, 2017.
[DNA Computing and Molecular Programming - 23rd International Conference, DNA 23, Austin, TX, USA, September 24-28, 2017, Proceedings.]

Flight Planning in Free Route Airspaces.
Casper Kehlet Jensen, Marco Chiarandini, Kim S. Larsen.
ATMOS, OASICS 59: 14:1-14:14, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
[17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2017, September 7-8, 2017, Vienna, Austria.]

Constraint Handling in Flight Planning.
Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen.
CP, Lecture Notes in Computer Science 10416: 354-369, Springer, 2017.
[Principles and Practice of Constraint Programming - 23rd International Conference, CP 2017, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings.]

Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps.
Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth.
WABI, LIPIcs 88: 17:1-17:12, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
[17th International Workshop on Algorithms in Bioinformatics, WABI 2017, August 21-23, 2017, Boston, MA, USA.]

Parameterized Constraint Satisfaction Problems: a Survey.
Gregory Z. Gutin, Anders Yeo.
The Constraint Satisfaction Problem: 179-203, 2017.


2016

Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs.
Jørgen Bang-Jensen, Saket Saurabh, Sven Simonsen.
Algorithmica 76(1): 279-296, 2016.

Finding good 2-partitions of digraphs II. Enumerable properties.
Jørgen Bang-Jensen, Nathann Cohen, Frédéric Havet.
Theor. Comput. Sci. 640: 1-19, 2016.

Finding good 2-partitions of digraphs I. Hereditary properties.
Jørgen Bang-Jensen, Frédéric Havet.
Theor. Comput. Sci. 636: 85-94, 2016.

The complexity of finding arc-disjoint branching flows.
Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo.
Discrete Applied Mathematics 209: 16-26, 2016.

Arc-Disjoint Directed and Undirected Cycles in Digraphs.
Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen.
Journal of Graph Theory 83(4): 406-420, 2016.

DAG-Width and Circumference of Digraphs.
Jørgen Bang-Jensen, Tilde My Larsen.
Journal of Graph Theory 82(2): 194-206, 2016.

Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments.
Jørgen Bang-Jensen, Alessandro Maddaloni, Saket Saurabh.
Algorithmica 76(2): 320-343, 2016.

Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths.
Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo.
Inf. Process. Lett. 116(6): 433-436, 2016.

Biased Predecessor Search.
Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin.
Algorithmica 76(4): 1097-1105, 2016.

Online Algorithms with Advice: A Survey.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen.
SIGACT News 47(3): 93-129, 2016.

On various nonlinearity measures for boolean functions.
Joan Boyar, Magnus Gausdal Find, René Peralta.
Cryptography and Communications 8(3): 313-330, 2016.

Online Bin Packing with Advice.
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz.
Algorithmica 74(1): 507-527, 2016.

One-sided interval edge-colorings of bipartite graphs.
Carl Johan Casselgren, Bjarne Toft.
Discrete Mathematics 339(11): 2628-2639, 2016.

Parameterizations of Test Cover with Bounded Test Sizes.
Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia, Anders Yeo.
Algorithmica 74(1): 367-384, 2016.

Independence in 5-uniform hypergraphs.
Alex Eustis, Michael A. Henning, Anders Yeo.
Discrete Mathematics 339(2): 1004-1027, 2016.

Transversals in 4-Uniform Hypergraphs.
Michael A. Henning, Anders Yeo.
Electr. J. Comb. 23(3): P3.50, 2016.

A Software Package for Chemically Inspired Graph Transformation.
Jakob L. Andersen, Christoph Flamm, Daniel Merkle, Peter F. Stadler.
ICGT, Lecture Notes in Computer Science 9761: 73-88, Springer, 2016.
[Graph Transformation - 9th International Conference, ICGT 2016, in Memory of Hartmut Ehrig, Held as Part of STAF 2016, Vienna, Austria, July 5-6, 2016, Proceedings.]

Online Dominating Set.
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen.
SWAT, LIPIcs 53: 21:1-21:15, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016.
[15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland.]

Online Bounded Analysis.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin.
CSR, Lecture Notes in Computer Science 9691: 131-145, Springer, 2016.
[Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings.]

Batch Coloring of Graphs.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin.
WAOA, Lecture Notes in Computer Science 10138: 52-64, Springer, 2016.
[Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers.]

Weighted Online Problems with Advice.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen.
IWOCA, Lecture Notes in Computer Science 9843: 179-190, Springer, 2016.
[Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings.]

Automatic Inference of Graph Transformation Rules Using the Cyclic Nature of Chemical Reactions.
Christoph Flamm, Daniel Merkle, Peter F. Stadler, Uffe Thorsen.
ICGT, Lecture Notes in Computer Science 9761: 206-222, Springer, 2016.
[Graph Transformation - 9th International Conference, ICGT 2016, in Memory of Hartmut Ehrig, Held as Part of STAF 2016, Vienna, Austria, July 5-6, 2016, Proceedings.]

Vertical Optimization of Resource Dependent Flight Paths.
Anders Nicolai Knudsen, Marco Chiarandini, Kim S. Larsen.
ECAI, Frontiers in Artificial Intelligence and Applications 285: 639-645, IOS Press, 2016.
[ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016).]

String Sorting.
Rolf Fagerberg.
Encyclopedia of Algorithms: 2117-2121, 2016.

Cache-Oblivious B-Tree.
Rolf Fagerberg.
Encyclopedia of Algorithms: 261-264, 2016.

Cache-Oblivious Model.
Rolf Fagerberg.
Encyclopedia of Algorithms: 264-269, 2016.

Kernelization, MaxLin Above Average.
Anders Yeo.
Encyclopedia of Algorithms: 1024-1028, 2016.


2015

Towards Optimal DNA-Templated Computing.
Jakob L. Andersen, Christoph Flamm, Martin M. Hanczyc, Daniel Merkle.
IJUC 11(3-4): 185-203, 2015.

Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles.
Jørgen Bang-Jensen, Stéphane Bessy.
Journal of Graph Theory 79(4): 249-266, 2015.

Restricted cycle factors and arc-decompositions of digraphs.
Jørgen Bang-Jensen, Carl Johan Casselgren.
Discrete Applied Mathematics 193: 80-93, 2015.

Vertex coloring edge-weighted digraphs.
Jørgen Bang-Jensen, Magnús M. Halldórsson.
Inf. Process. Lett. 115(10): 791-796, 2015.

Finding a subdivision of a digraph.
Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia.
Theor. Comput. Sci. 562: 283-303, 2015.

Sufficient Conditions for a Digraph to be Supereulerian.
Jørgen Bang-Jensen, Alessandro Maddaloni.
Journal of Graph Theory 79(1): 8-20, 2015.

Balanced branchings in digraphs.
Jørgen Bang-Jensen, Anders Yeo.
Theor. Comput. Sci. 595: 107-119, 2015.

New and improved spanning ratios for Yao graphs.
Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia.
JoCG 6(2): 19-53, 2015.

Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles.
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot.
SIAM J. Comput. 44(6): 1626-1649, 2015.

Cancellation-free circuits in unbounded and bounded depth.
Joan Boyar, Magnus Gausdal Find.
Theor. Comput. Sci. 590: 17-26, 2015.

Relative interval analysis of paging algorithms on access graphs.
Joan Boyar, Sushmita Gupta, Kim S. Larsen.
Theor. Comput. Sci. 568: 28-48, 2015.

A Comparison of Performance Measures for Online Algorithms.
Joan Boyar, Sandy Irani, Kim S. Larsen.
Algorithmica 72(4): 969-994, 2015.

The Frequent Items Problem in Online Streaming Under Various Performance Measures.
Joan Boyar, Kim S. Larsen, Abyayananda Maiti.
Int. J. Found. Comput. Sci. 26(4): 413-440, 2015.

On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees.
Carl Johan Casselgren, Bjarne Toft.
Journal of Graph Theory 80(2): 83-97, 2015.

Online multi-coloring with advice.
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen.
Theor. Comput. Sci. 596: 79-91, 2015.

Soccer is Harder Than Football.
Jan Christensen, Anders Nicolai Knudsen, Kim S. Larsen.
Int. J. Found. Comput. Sci. 26(4): 477-486, 2015.

Progress on the Murty-Simon Conjecture on diameter-2 critical graphs: a survey.
Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo.
J. Comb. Optim. 30(3): 579-595, 2015.

On 2-Colorings of Hypergraphs.
Michael A. Henning, Anders Yeo.
Journal of Graph Theory 80(2): 112-135, 2015.

Total Transversals in Hypergraphs and Their Applications.
Michael A. Henning, Anders Yeo.
SIAM J. Discrete Math. 29(1): 309-320, 2015.

Task allocation in organic computing systems: networks with reconfigurable helper units.
Daniel Merkle, Martin Middendorf, Alexander Scheidler.
IJAACS 8(1): 60-80, 2015.

Competitive Local Routing with Constraints.
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot.
ISAAC, Lecture Notes in Computer Science 9472: 23-34, Springer, 2015.
[Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings.]

Advice Complexity for a Class of Online Problems.
Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen.
STACS, LIPIcs 30: 116-129, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015.
[32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany.]

Constructive Relationships Between Algebraic Thickness and Normality.
Joan Boyar, Magnus Gausdal Find.
FCT, Lecture Notes in Computer Science 9210: 106-117, Springer, 2015.
[Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings.]

Adding Isolated Vertices Makes Some Online Algorithms Optimal.
Joan Boyar, Christian Kudahl.
IWOCA, Lecture Notes in Computer Science 9538: 65-76, Springer, 2015.
[Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers.]


2014

On the Meyniel condition for hamiltonicity in bipartite digraphs.
Janusz Adamus, Lech Adamus, Anders Yeo.
Discrete Mathematics & Theoretical Computer Science 16(1): 293-302, 2014.

Generic strategies for chemical space exploration.
Jakob L. Andersen, Christoph Flamm, Daniel Merkle, Peter F. Stadler.
I. J. Computational Biology and Drug Design 7(2/3): 225-258, 2014.

Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs.
Jørgen Bang-Jensen, Jing Huang.
Journal of Graph Theory 77(4): 278-298, 2014.

(Arc-)disjoint flows in networks.
Jørgen Bang-Jensen, Stéphane Bessy.
Theor. Comput. Sci. 526: 28-40, 2014.

Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments.
Jørgen Bang-Jensen, Stéphane Bessy, Stéphan Thomassé.
Journal of Graph Theory 75(3): 284-302, 2014.

Vertex-disjoint directed and undirected cycles in general digraphs.
Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen.
J. Comb. Theory, Ser. B 106: 1-14, 2014.

Arc-Disjoint Paths in Decomposable Digraphs.
Jørgen Bang-Jensen, Alessandro Maddaloni.
Journal of Graph Theory 77(2): 89-110, 2014.

The complexity of multicut and mixed multicut problems in (di)graphs.
Jørgen Bang-Jensen, Anders Yeo.
Theor. Comput. Sci. 520: 87-96, 2014.

A comparison of performance measures via online search.
Joan Boyar, Kim S. Larsen, Abyayananda Maiti.
Theor. Comput. Sci. 532: 2-13, 2014.

Total Transversals and Total Domination in Uniform Hypergraphs.
Csilla Bujtás, Michael A. Henning, Zsolt Tuza, Anders Yeo.
Electr. J. Comb. 21(2): P2.24, 2014.

Online bin covering: Expectations vs. guarantees.
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen.
Theor. Comput. Sci. 556: 71-84, 2014.

Satisfying more than half of a system of linear equations over GF(2): A multivariate approach.
Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo.
J. Comput. Syst. Sci. 80(4): 687-696, 2014.

Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables.
Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo.
Algorithmica 68(3): 739-757, 2014.

Total Domination in Graphs with Diameter 2.
Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning, Anders Yeo.
Journal of Graph Theory 75(1): 91-103, 2014.

Relating the annihilation number and the 2-domination number of a tree.
Wyatt J. Desormeaux, Michael A. Henning, Douglas F. Rall, Anders Yeo.
Discrete Mathematics 319: 15-23, 2014.

A New Lower Bound on the Independence Number of a Graph and Applications.
Michael A. Henning, Christian Löwenstein, Justin Southey, Anders Yeo.
Electr. J. Comb. 21(1): P1.38, 2014.

Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs.
Michael A. Henning, Anders Yeo.
Graphs and Combinatorics 30(4): 909-932, 2014.

A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture.
Michael A. Henning, Anders Yeo.
Discrete Applied Mathematics 173: 45-52, 2014.

A winning strategy for 3×n Cylindrical Hex.
Samuel Clowes Huneke, Ryan B. Hayward, Bjarne Toft.
Discrete Mathematics 331: 93-97, 2014.

50 Shades of Rule Composition - From Chemical Reactions to Higher Levels of Abstraction.
Jakob Lykke Andersen, Christoph Flamm, Daniel Merkle, Peter F. Stadler.
FMMB, Lecture Notes in Computer Science 8738: 117-135, Springer, 2014.
[Formal Methods in Macro-Biology - First International Conference, FMMB 2014, Nouméa, New Caledonia, September 22-24, 2014. Proceedings.]

Continuous Yao Graphs.
Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot.
CCCG, Carleton University, Ottawa, Canada, 2014.
[Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Nova Scotia, Canada, 2014.]

New and Improved Spanning Ratios for Yao Graphs.
Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia.
Symposium on Computational Geometry: 30, ACM, 2014.
[30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014.]

Biased Predecessor Search.
Prosenjit Bose, Rolf Fagerberg, John Howat, Pat Morin.
LATIN, Lecture Notes in Computer Science 8392: 755-764, Springer, 2014.
[LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings.]

The Relationship between Multiplicative Complexity and Nonlinearity.
Joan Boyar, Magnus Gausdal Find.
MFCS (2), Lecture Notes in Computer Science 8635: 130-140, Springer, 2014.
[Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II.]

On the List Update Problem with Advice.
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz.
LATA, Lecture Notes in Computer Science 8370: 210-221, Springer, 2014.
[Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings.]

Online Bin Packing with Advice.
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz.
STACS, LIPIcs 25: 174-186, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014.
[31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France.]

Online Multi-Coloring with Advice.
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen.
WAOA, Lecture Notes in Computer Science 8952: 83-94, Springer, 2014.
[Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers.]

Online Dual Edge Coloring of Paths and Trees.
Lene M. Favrholdt, Jesper W. Mikkelsen.
WAOA, Lecture Notes in Computer Science 8952: 181-192, Springer, 2014.
[Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers.]

Group communication patterns for high performance computing in scala.
Felix Palludan Hargreaves, Daniel Merkle, Peter Schneider-Kamp.
FHPC@ICFP: 75-85, ACM, 2014.
[Proceedings of the 3rd ACM SIGPLAN workshop on Functional high-performance computing, FHPC@ICFP 2014, Gothenburg, Sweden, September 4, 2014.]


2013

Navigating the Chemical Space of HCN Polymerization and Hydrolysis: Guiding Graph Grammars by Mass Spectrometry Data.
Jakob L. Andersen, Tommy Andersen, Christoph Flamm, Martin M. Hanczyc, Daniel Merkle, Peter F. Stadler.
Entropy 15(10): 4066-4083, 2013.

Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties.
Jørgen Bang-Jensen, Daniel Gonçalves, Anders Yeo.
Theor. Comput. Sci. 475: 13-20, 2013.

Quasi-hamiltonian paths in semicomplete multipartite digraphs.
Jørgen Bang-Jensen, Alessandro Maddaloni, Sven Simonsen.
Discrete Applied Mathematics 161(7-8): 889-898, 2013.

Arc-disjoint paths and trees in 2-regular digraphs.
Jørgen Bang-Jensen, Sven Simonsen.
Discrete Applied Mathematics 161(16-17): 2724-2730, 2013.

Logic Minimization Techniques with Applications to Cryptology.
Joan Boyar, Philip Matthews, René Peralta.
J. Cryptology 26(2): 280-312, 2013.

Online multi-coloring on the path revisited.
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen.
Acta Inf. 50(5-6): 343-357, 2013.

On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem.
Jason Crampton, Gregory Z. Gutin, Anders Yeo.
ACM Trans. Inf. Syst. Secur. 16(1): 4:1-4:31, 2013.

Parameterized Complexity of Satisfying Almost All Linear Equations over $\\mathbb{F}_{2}$.
Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo.
Theory Comput. Syst. 52(4): 719-728, 2013.

List Factoring and Relative Worst Order Analysis.
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen.
Algorithmica 66(2): 287-309, 2013.

A Technique for Exact Computation of precoloring Extension on Interval Graphs.
Martin R. Ehmsen, Kim S. Larsen.
Int. J. Found. Comput. Sci. 24(1): 109-122, 2013.

Better bounds on online unit clustering.
Martin R. Ehmsen, Kim S. Larsen.
Theor. Comput. Sci. 500: 1-24, 2013.

On the Complexity of Reconstructing Chemical Reaction Networks.
Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters, Peter F. Stadler.
Mathematics in Computer Science 7(3): 275-292, 2013.

A new bound for 3-satisfiable MaxSat and its algorithmic application.
Gregory Z. Gutin, Mark Jones, Dominik Scheder, Anders Yeo.
Inf. Comput. 231: 117-124, 2013.

(Non-)existence of polynomial kernels for the Test Cover problem.
Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo.
Inf. Process. Lett. 113(4): 123-126, 2013.

Parameterized complexity of k-Chinese Postman Problem.
Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo.
Theor. Comput. Sci. 513: 124-128, 2013.

Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo.
Theory Comput. Syst. 53(4): 690-691, 2013.

Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three.
Michael A. Henning, Anders Yeo.
Journal of Graph Theory 72(2): 220-245, 2013.

Transversals and matchings in 3-uniform hypergraphs.
Michael A. Henning, Anders Yeo.
Eur. J. Comb. 34(2): 217-228, 2013.

22-colorings in kk-regular kk-uniform hypergraphs.
Michael A. Henning, Anders Yeo.
Eur. J. Comb. 34(7): 1192-1202, 2013.

Total domination and matching numbers in graphs with all vertices in triangles.
Michael A. Henning, Anders Yeo.
Discrete Mathematics 313(2): 174-181, 2013.

Hypergraphs with large transversal number.
Michael A. Henning, Anders Yeo.
Discrete Mathematics 313(8): 959-966, 2013.

A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.
Andreas Sand, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Thomas Mailund.
BMC Bioinformatics 14(S-2): S18, 2013.

Swarm controlled emergence for ant clustering.
Alexander Scheidler, Daniel Merkle, Martin Middendorf.
Int. J. Intelligent Computing and Cybernetics 6(1): 62-82, 2013.

Bounds for Scheduling Jobs on Grid Processors.
Joan Boyar, Faith Ellen.
Space-Efficient Data Structures, Streams, and Algorithms, Lecture Notes in Computer Science 8066: 12-26, Springer, 2013.
[Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday.]

Four Measures of Nonlinearity.
Joan Boyar, Magnus Find, René Peralta.
CIAC, Lecture Notes in Computer Science 7878: 61-72, Springer, 2013.
[Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings.]

Cancellation-Free Circuits in Unbounded and Bounded Depth.
Joan Boyar, Magnus Gausdal Find.
FCT, Lecture Notes in Computer Science 8070: 159-170, Springer, 2013.
[Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings.]

Relative Interval Analysis of Paging Algorithms on Access Graphs.
Joan Boyar, Sushmita Gupta, Kim S. Larsen.
WADS, Lecture Notes in Computer Science 8037: 195-206, Springer, 2013.
[Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings.]

The Frequent Items Problem in Online Streaming under Various Performance Measures.
Joan Boyar, Kim S. Larsen, Abyayananda Maiti.
FCT, Lecture Notes in Computer Science 8070: 60-71, Springer, 2013.
[Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings.]

Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.
Gerth Stølting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand.
SODA: 1814-1832, SIAM, 2013.
[Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013.]

Online Bin Covering: Expectations vs. Guarantees.
Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen.
COCOA, Lecture Notes in Computer Science 8287: 226-237, Springer, 2013.
[Combinatorial Optimization and Applications - 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings.]

Barrier Trees for Metabolic Adjustment Landscapes.
Christoph Flamm, Chris Hemmingsen, Daniel Merkle.
ECAL: 1151-1158, MIT Press, 2013.
[Proceedings of the Twelfth European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, ECAL 2013, Sicily, Italy, September 2-6, 2013.]

FooPar: A Functional Object Oriented Parallel Framework in Scala.
Felix Palludan Hargreaves, Daniel Merkle.
PPAM (2), Lecture Notes in Computer Science 8385: 118-129, Springer, 2013.
[Parallel Processing and Applied Mathematics - 10th International Conference, PPAM 2013, Warsaw, Poland, September 8-11, 2013, Revised Selected Papers, Part II.]


2012

Decomposing locally semicomplete digraphs into strong spanning subdigraphs.
Jørgen Bang-Jensen, Jing Huang.
J. Comb. Theory, Ser. B 102(3): 701-714, 2012.

Finding an induced subdivision of a digraph.
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon.
Theor. Comput. Sci. 443: 10-24, 2012.

Efficient algorithms for real-life instances of the variable size bin packing problem.
Jørgen Bang-Jensen, Rune Larsen.
Computers & OR 39(11): 2848-2857, 2012.

Arc-disjoint spanning sub(di)graphs in digraphs.
Jørgen Bang-Jensen, Anders Yeo.
Theor. Comput. Sci. 438: 48-54, 2012.

On the absolute approximation ratio for First Fit and related results.
Joan Boyar, György Dósa, Leah Epstein.
Discrete Applied Mathematics 160(13-14): 1914-1923, 2012.

A new variable-sized bin packing problem.
Joan Boyar, Lene M. Favrholdt.
J. Scheduling 15(3): 273-287, 2012.

A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications.
Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo.
Algorithmica 64(1): 56-68, 2012.

Parameterized Eulerian strong component arc deletion problem on tournaments.
Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo.
Inf. Process. Lett. 112(6): 249-251, 2012.

Comparing online algorithms for bin packing problems.
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt.
J. Scheduling 15(1): 13-21, 2012.

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.
Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo.
Algorithmica 64(1): 112-125, 2012.

Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables.
Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo.
J. Comput. Syst. Sci. 78(1): 151-163, 2012.

An algorithm for finding input-output constrained convex sets in an acyclic digraph.
Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo.
J. Discrete Algorithms 13: 47-58, 2012.

Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width.
Gregory Z. Gutin, Anders Yeo.
Discrete Applied Mathematics 160(15): 2323-2328, 2012.

On a conjecture of Murty and Simon on diameter two critical graphs II.
Teresa W. Haynes, Michael A. Henning, Anders Yeo.
Discrete Mathematics 312(2): 315-323, 2012.

How to play Reverse Hex.
Ryan B. Hayward, Bjarne Toft, Philip Henderson.
Discrete Mathematics 312(1): 148-156, 2012.

Girth and Total Domination in Graphs.
Michael A. Henning, Anders Yeo.
Graphs and Combinatorics 28(2): 199-214, 2012.

Vertex Disjoint Cycles of Different Length in Digraphs.
Michael A. Henning, Anders Yeo.
SIAM J. Discrete Math. 26(2): 687-694, 2012.

Identifying Vertex Covers in Graphs.
Michael A. Henning, Anders Yeo.
Electr. J. Comb. 19(4): P32, 2012.

De-amortizing Binary Search Trees.
Prosenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman.
ICALP (1), Lecture Notes in Computer Science 7391: 121-132, Springer, 2012.
[Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I.]

Competitive Routing on a Bounded-Degree Plane Spanner.
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot.
CCCG: 285-290, 2012.
[Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012.]

Competitive routing in the half-θ6-graph.
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot.
SODA: 1319-1328, SIAM, 2012.
[Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012.]

On Plane Constrained Bounded-Degree Spanners.
Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot.
LATIN, Lecture Notes in Computer Science 7256: 85-96, Springer, 2012.
[LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings.]

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis.
Joan Boyar, Sushmita Gupta, Kim S. Larsen.
SWAT, Lecture Notes in Computer Science 7357: 328-339, Springer, 2012.
[Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings.]

A Comparison of Performance Measures via Online Search.
Joan Boyar, Kim S. Larsen, Abyayananda Maiti.
FAW-AAIM, Lecture Notes in Computer Science 7285: 303-314, Springer, 2012.
[Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings.]

A Small Depth-16 Circuit for the AES S-Box.
Joan Boyar, René Peralta.
SEC, IFIP Advances in Information and Communication Technology 376: 287-298, Springer, 2012.
[Information Security and Privacy Research - 27th IFIP TC 11 Information Security and Privacy Conference, SEC 2012, Heraklion, Crete, Greece, June 4-6, 2012. Proceedings.]

On the parameterized complexity of the workflow satisfiability problem.
Jason Crampton, Gregory Z. Gutin, Anders Yeo.
ACM Conference on Computer and Communications Security: 857-868, ACM, 2012.
[the ACM Conference on Computer and Communications Security, CCS'12, Raleigh, NC, USA, October 16-18, 2012.]

Parameterized Study of the Test Cover Problem.
Robert Crowston, Gregory Z. Gutin, Mark Jones, Saket Saurabh, Anders Yeo.
MFCS, Lecture Notes in Computer Science 7464: 283-295, Springer, 2012.
[Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings.]

Fixed-Parameter Tractability of Satisfying beyond the Number of Variables.
Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh, Anders Yeo.
SAT, Lecture Notes in Computer Science 7317: 355-368, Springer, 2012.
[Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings.]

Exploring Chemistry Using SMT.
Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters.
CP, Lecture Notes in Computer Science 7514: 900-915, Springer, 2012.
[Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012. Proceedings.]

Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey.
Gregory Z. Gutin, Anders Yeo.
The Multivariate Algorithmic Revolution and Beyond, Lecture Notes in Computer Science 7370: 257-286, Springer, 2012.
[The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday.]


2011

Solving MAX-r-SAT Above a Tight Lower Bound.
Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo.
Algorithmica 61(3): 638-655, 2011.

Finding an induced subdivision of a digraph.
Jørgen Bang-Jensen, Frédéric Havet, Nicolas Trotignon.
Electronic Notes in Discrete Mathematics 37: 9-14, 2011.

On the problem of finding disjoint cycles and dicycles in a digraph.
Jørgen Bang-Jensen, Matthias Kriesell.
Combinatorica 31(6): 639-668, 2011.

The Cost of Cache-Oblivious Searching.
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz.
Algorithmica 61(2): 463-505, 2011.

Finding all sorting tandem duplication random loss operations.
Matthias Bernt, Kuan-Yu Chen, Ming-Chiang Chen, An-Chiang Chu, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf.
J. Discrete Algorithms 9(1): 32-48, 2011.

Kernel bounds for disjoint cycles and disjoint paths.
Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo.
Theor. Comput. Sci. 412(35): 4570-4578, 2011.

Online variable-sized bin packing with conflicts.
Leah Epstein, Lene M. Favrholdt, Asaf Levin.
Discrete Optimization 8(2): 333-343, 2011.

A probabilistic approach to problems parameterized above or below tight bounds.
Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo.
J. Comput. Syst. Sci. 77(2): 422-429, 2011.

Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems.
Gregory Z. Gutin, Mark Jones, Anders Yeo.
Theor. Comput. Sci. 412(41): 5744-5751, 2011.

On the existence of k-partite or Kp-free total domination edge-critical graphs.
Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo.
Discrete Mathematics 311(13): 1142-1149, 2011.

On a conjecture of Murty and Simon on diameter 2-critical graphs.
Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe, Anders Yeo.
Discrete Mathematics 311(17): 1918-1924, 2011.

A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free.
Teresa W. Haynes, Michael A. Henning, Anders Yeo.
Discrete Optimization 8(3): 495-501, 2011.

A New Bound on the Domination Number of Graphs with Minimum Degree Two.
Michael A. Henning, Ingo Schiermeyer, Anders Yeo.
Electr. J. Comb. 18(1), 2011.

Perfect Matchings in Total Domination Critical Graphs.
Michael A. Henning, Anders Yeo.
Graphs and Combinatorics 27(5): 685-701, 2011.

A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles.
Gary MacGillivray, Jacobus Swarts, Jørgen Bang-Jensen.
Contributions to Discrete Mathematics 6(2), 2011.

A kernel of order 2k-c for Vertex Cover.
Arezou Soleimanfallah, Anders Yeo.
Discrete Mathematics 311(10-11): 892-895, 2011.

Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average.
Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo.
FSTTCS, LIPIcs 13: 229-240, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011.
[IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India.]

A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application.
Gregory Z. Gutin, Mark Jones, Anders Yeo.
FCT, Lecture Notes in Computer Science 6914: 138-147, Springer, 2011.
[Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings.]

Ant Inspired Methods for Organic Computing.
Alexander Scheidler, Arne Brutschy, Konrad Diwold, Daniel Merkle, Martin Middendorf.
Organic Computing: 95-109, 2011.


2010

A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation.
Jørgen Bang-Jensen, Marco Chiarandini, Peter Morling.
Networks 55(4): 299-325, 2010.

Spanning 2-strong tournaments in 3-strong semicomplete digraphs.
Jørgen Bang-Jensen, Tibor Jordán.
Discrete Mathematics 310(9): 1424-1428, 2010.

The complexity of colouring by locally semicomplete digraphs.
Jørgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts.
Discrete Mathematics 310(20): 2675-2684, 2010.

Heuristics for the central tree problem.
Jørgen Bang-Jensen, Yury Nikulin.
J. Heuristics 16(5): 633-651, 2010.

Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model.
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari.
Theory Comput. Syst. 47(4): 934-962, 2010.

Priority algorithms for graph optimization problems.
Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi.
Theor. Comput. Sci. 411(1): 239-258, 2010.

A theoretical comparison of LRU and LRU-K.
Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen.
Acta Inf. 47(7-8): 359-374, 2010.

Tight results for Next Fit and Worst Fit with resource augmentation.
Joan Boyar, Leah Epstein, Asaf Levin.
Theor. Comput. Sci. 411(26-28): 2572-2580, 2010.

Scheduling Jobs on Grid Processors.
Joan Boyar, Lene M. Favrholdt.
Algorithmica 57(4): 819-847, 2010.

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem.
Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo.
J. Comput. Syst. Sci. 76(7): 650-662, 2010.

FPT algorithms and kernels for the Directed k-Leaf problem.
Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo.
J. Comput. Syst. Sci. 76(2): 144-152, 2010.

Comparing First-Fit and Next-Fit for online edge coloring.
Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai.
Theor. Comput. Sci. 411(16-18): 1734-1741, 2010.

Betweenness parameterized above tight lower bound.
Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo.
J. Comput. Syst. Sci. 76(8): 872-878, 2010.

Note on maximal bisection above tight lower bound.
Gregory Z. Gutin, Anders Yeo.
Inf. Process. Lett. 110(21): 966-969, 2010.

Strong Transversals in Hypergraphs and Double Total Domination in Graphs.
Michael A. Henning, Anders Yeo.
SIAM J. Discrete Math. 24(4): 1336-1355, 2010.

Double-Critical Graphs and Complete Minors.
Ken-ichi Kawarabayashi, Anders Sune Pedersen, Bjarne Toft.
Electr. J. Comb. 17(1), 2010.

Competitive analysis of the online inventory problem.
Kim S. Larsen, Sanne Wøhlk.
European Journal of Operational Research 207(2): 685-696, 2010.

A parameter-adaptive dynamic programming approach for inferring cophylogenies.
Daniel Merkle, Martin Middendorf, Nicolas Wieseke.
BMC Bioinformatics 11(S-1): 60, 2010.

A basic elementary extension of the Duchet-Meyniel theorem.
Anders Sune Pedersen, Bjarne Toft.
Discrete Mathematics 310(3): 480-488, 2010.

Preface.
Bjarne Toft.
Discrete Mathematics 310(20): 2571-2572, 2010.

Solving MAX-r-SAT Above a Tight Lower Bound.
Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo.
SODA: 511-517, SIAM, 2010.
[Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010.]

An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg.
SWAT, Lecture Notes in Computer Science 6139: 38-49, Springer, 2010.
[Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings.]

A New Combinational Logic Minimization Technique with Applications to Cryptology.
Joan Boyar, René Peralta.
SEA, Lecture Notes in Computer Science 6049: 178-189, Springer, 2010.
[Experimental Algorithms, 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings.]

A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application.
Robert Crowston, Gregory Z. Gutin, Mark Jones, Anders Yeo.
IPEC, Lecture Notes in Computer Science 6478: 84-94, Springer, 2010.
[Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings.]

List Factoring and Relative Worst Order Analysis.
Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen.
WAOA, Lecture Notes in Computer Science 6534: 118-129, Springer, 2010.
[Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers.]

Better Bounds on Online Unit Clustering.
Martin R. Ehmsen, Kim S. Larsen.
SWAT, Lecture Notes in Computer Science 6139: 371-382, Springer, 2010.
[Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings.]

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.
Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo.
IPEC, Lecture Notes in Computer Science 6478: 158-169, Springer, 2010.
[Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings.]

All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables.
Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo.
ESA (1), Lecture Notes in Computer Science 6346: 326-337, Springer, 2010.
[Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I.]

Barrier Trees for Continuous Fitness Landscapes.
Jacob Midtgaard-Olesen, Carsten Baldauf, Daniel Merkle.
ALIFE: 368-369, MIT Press, 2010.
[Artificial Life XII: Proceedings of the Twelfth International Conference on the Synthesis and Simulation of Living Systems, Odense, Denmark, August 19-23, 2010.]


2009

Algorithms for generating convex sets in acyclic digraphs.
Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo.
J. Discrete Algorithms 7(4): 509-518, 2009.

k-strong spanning local tournaments in locally semicomplete digraphs.
Jørgen Bang-Jensen.
Discrete Applied Mathematics 157(11): 2536-2540, 2009.

Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs.
Jørgen Bang-Jensen.
Discrete Mathematics 309(18): 5655-5667, 2009.

Disjoint sub(di)graphs in digraphs.
Jørgen Bang-Jensen, Matthias Kriesell.
Electronic Notes in Discrete Mathematics 34: 179-183, 2009.

Disjoint directed and undirected paths and cycles in digraphs.
Jørgen Bang-Jensen, Matthias Kriesell.
Theor. Comput. Sci. 410(47-49): 5138-5144, 2009.

Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts.
Philip Bille, Rolf Fagerberg, Inge Li Gørtz.
ACM Trans. Algorithms 6(1): 3:1-3:14, 2009.

Adapting to Dynamic Environments: Polyethism in Response Threshold Models for Social Insects.
Konrad Diwold, Daniel Merkle, Martin Middendorf.
Advances in Complex Systems 12(3): 327-346, 2009.

Special issue on ant colony optimization.
Karl F. Doerner, Daniel Merkle, Thomas Stützle.
Swarm Intelligence 3(1): 1-2, 2009.

Total Domination in Partitioned Graphs.
Allan Frendrup, Preben D. Vestergaard, Anders Yeo.
Graphs and Combinatorics 25(2): 181-196, 2009.

Minimum Cost Homomorphism Dichotomy for Oriented Cycles.
Gregory Z. Gutin, Arash Rafiey, Anders Yeo.
Graphs and Combinatorics 25(4): 521-531, 2009.

On the number of connected convex subgraphs of a connected acyclic digraph.
Gregory Z. Gutin, Anders Yeo.
Discrete Applied Mathematics 157(7): 1660-1662, 2009.

Some complexity problems on single input double output controllers.
Katalin M. Hangos, Zsolt Tuza, Anders Yeo.
Discrete Applied Mathematics 157(5): 1146-1158, 2009.

Extended shapes for the combinatorial design of RNA sequences.
Marc Hellmuth, Daniel Merkle, Martin Middendorf.
I. J. Computational Biology and Drug Design 2(4): 371-384, 2009.

Total domination in 2-connected graphs and in graphs with no induced 6-cycles.
Michael A. Henning, Anders Yeo.
Journal of Graph Theory 60(1): 55-79, 2009.

Editorial: Artificial Life.
Konstantin Klemm, Daniel Merkle, Eckehard Olbrich.
Advances in Complex Systems 12(3), 2009.

Finding All Sorting Tandem Duplication Random Loss Operations.
Matthias Bernt, Ming-Chiang Chen, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf.
CPM, Lecture Notes in Computer Science 5577: 301-313, Springer, 2009.
[Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings.]

Kernel Bounds for Disjoint Cycles and Disjoint Paths.
Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo.
ESA, Lecture Notes in Computer Science 5757: 635-646, Springer, 2009.
[Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings.]

A Polynomial Kernel for Multicut in Trees.
Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo.
STACS, LIPIcs 3: 183-194, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2009.
[26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings.]

A Comparison of Performance Measures for Online Algorithms.
Joan Boyar, Sandy Irani, Kim S. Larsen.
WADS, Lecture Notes in Computer Science 5664: 119-130, Springer, 2009.
[Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings.]

Online Sorted Range Reporting.
Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz.
ISAAC, Lecture Notes in Computer Science 5878: 173-182, Springer, 2009.
[Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings.]

Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem.
Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo.
COCOON, Lecture Notes in Computer Science 5609: 37-46, Springer, 2009.
[Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings.]

A Probabilistic Approach to Problems Parameterized above or below Tight Bounds.
Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo.
IWPEC, Lecture Notes in Computer Science 5917: 234-245, Springer, 2009.
[Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers.]

On the Design of RNA Sequences for Realizing Extended Shapes.
Marc Hellmuth, Daniel Merkle, Martin Middendorf.
IJCBS: 167-173, IEEE Computer Society, 2009.
[International Joint Conferences on Bioinformatics, Systems Biology and Intelligent Computing, IJCBS 2009, Shanghai, China, 3-5 August 2009.]

Better Than Optimal: Fast Identification of Custom Instruction Candidates.
Joseph Reddington, Gregory Z. Gutin, Adrian Johnstone, Elizabeth Scott, Anders Yeo.
CSE (2): 17-24, IEEE Computer Society, 2009.
[Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, CSE 2009, Vancouver, BC, Canada, August 29-31, 2009.]


2008

On persistent directed graphs.
Jørgen Bang-Jensen, Tibor Jordán.
Networks 52(4): 271-276, 2008.

Minimum cycle factors in quasi-transitive digraphs.
Jørgen Bang-Jensen, Morten Hegner Nielsen.
Discrete Optimization 5(1): 121-137, 2008.

The minimum spanning strong subdigraph problem is fixed parameter tractable.
Jørgen Bang-Jensen, Anders Yeo.
Discrete Applied Mathematics 156(15): 2924-2929, 2008.

Solving the Preserving Reversal Median Problem.
Matthias Bernt, Daniel Merkle, Martin Middendorf.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(3): 332-347, 2008.

The relative worst order ratio applied to seat reservation.
Joan Boyar, Paul Medvedev.
ACM Trans. Algorithms 4(4): 48:1-48:22, 2008.

Tight bounds for the multiplicative complexity of symmetric functions.
Joan Boyar, René Peralta.
Theor. Comput. Sci. 396(1-3): 223-246, 2008.

On the adaptiveness of Quicksort.
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz.
ACM Journal of Experimental Algorithmics 12: 3.2:1-3.2:20, 2008.

A dichotomy for minimum cost graph homomorphisms.
Gregory Z. Gutin, Pavol Hell, Arash Rafiey, Anders Yeo.
Eur. J. Comb. 29(4): 900-911, 2008.

Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs.
Gregory Z. Gutin, Arash Rafiey, Anders Yeo.
SIAM J. Discrete Math. 22(4): 1624-1639, 2008.

Minimum cost homomorphisms to semicomplete multipartite digraphs.
Gregory Z. Gutin, Arash Rafiey, Anders Yeo.
Discrete Applied Mathematics 156(12): 2429-2435, 2008.

Fixed-Parameter Complexity of Minimum Profile Problems.
Gregory Z. Gutin, Stefan Szeider, Anders Yeo.
Algorithmica 52(2): 133-152, 2008.

Some Parameterized Problems On Digraphs.
Gregory Z. Gutin, Anders Yeo.
Comput. J. 51(3): 363-371, 2008.

Hoàng-Reed conjecture holds for tournaments.
Frédéric Havet, Stéphan Thomassé, Anders Yeo.
Discrete Mathematics 308(15): 3412-3415, 2008.

On matching and total domination in graphs.
Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo.
Discrete Mathematics 308(11): 2313-2318, 2008.

Hypergraphs with large transversal number and with edge sizes at least 3.
Michael A. Henning, Anders Yeo.
Journal of Graph Theory 59(4): 326-348, 2008.

Total Domination in Graphs with Given Girth.
Michael A. Henning, Anders Yeo.
Graphs and Combinatorics 24(4): 333-348, 2008.

A decentralization approach for swarm intelligence algorithms in networks applied to multi swarm PSO.
Stefan Janson, Daniel Merkle, Martin Middendorf.
Int. J. Intelligent Computing and Cybernetics 1(1): 25-45, 2008.

Molecular docking with multi-objective Particle Swarm Optimization.
Stefan Janson, Daniel Merkle, Martin Middendorf.
Appl. Soft Comput. 8(1): 666-675, 2008.

Self-Organized Task Allocation for Service Tasks in Computing Systems with Reconfigurable Components.
Daniel Merkle, Martin Middendorf, Alexander Scheidler.
J. Math. Model. Algorithms 7(2): 237-254, 2008.

Stability and performance of ant queue inspired task partitioning methods.
Alexander Scheidler, Daniel Merkle, Martin Middendorf.
Theory in Biosciences 127(2): 149-161, 2008.

Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.
Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg.
J. Bioinformatics and Computational Biology 6(1): 37-50, 2008.

An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree.
Matthias Bernt, Daniel Merkle, Martin Middendorf.
RECOMB-CG, Lecture Notes in Computer Science 5267: 143-157, Springer, 2008.
[Comparative Genomics, International Workshop, RECOMB-CG 2008, Paris, France, October 13-15, 2008. Proceedings.]

On the Shortest Linear Straight-Line Program for Computing Linear Forms.
Joan Boyar, Philip Matthews, René Peralta.
MFCS, Lecture Notes in Computer Science 5162: 168-179, Springer, 2008.
[Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings.]

Learning from House-Hunting Ants: Collective Decision-Making in Organic Computing Systems.
Arne Brutschy, Alexander Scheidler, Daniel Merkle, Martin Middendorf.
ANTS Conference, Lecture Notes in Computer Science 5217: 96-107, Springer, 2008.
[Ant Colony Optimization and Swarm Intelligence, 6th International Conference, ANTS 2008, Brussels, Belgium, September 22-24, 2008. Proceedings.]

Comparing First-Fit and Next-Fit for Online Edge Coloring.
Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai.
ISAAC, Lecture Notes in Computer Science 5369: 89-99, Springer, 2008.
[Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings.]

An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph.
Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo.
WG, Lecture Notes in Computer Science 5344: 206-217, 2008.
[Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers.]

Minimum Cost Homomorphism Dichotomy for Oriented Cycles.
Gregory Z. Gutin, Arash Rafiey, Anders Yeo.
AAIM, Lecture Notes in Computer Science 5034: 224-234, Springer, 2008.
[Algorithmic Aspects in Information and Management, 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008. Proceedings.]

Emergent Sorting in Networks of Router Agents.
Alexander Scheidler, Christian Blum, Daniel Merkle, Martin Middendorf.
ANTS Conference, Lecture Notes in Computer Science 5217: 299-306, Springer, 2008.
[Ant Colony Optimization and Swarm Intelligence, 6th International Conference, ANTS 2008, Brussels, Belgium, September 22-24, 2008. Proceedings.]

Congestion Control in Ant Like Moving Agent Systems.
Alexander Scheidler, Daniel Merkle, Martin Middendorf.
BICC, IFIP 268: 33-43, Springer, 2008.
[Biologically-Inspired Collaborative Computing - IFIP 20th World Computer Congress, Second IFIP TC 10 International Conference on Biologically-Inspired Collaborative Computing, September 8-9, 2008, Milano, Italy.]

String Sorting.
Rolf Fagerberg.
Encyclopedia of Algorithms, 2008.

Cache-Oblivious Model.
Rolf Fagerberg.
Encyclopedia of Algorithms, 2008.

Cache-Oblivious B-Tree.
Rolf Fagerberg.
Encyclopedia of Algorithms, 2008.

Organic Computing and Swarm Intelligence.
Daniel Merkle, Martin Middendorf, Alexander Scheidler.
Swarm Intelligence: 253-281, 2008.


2007

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs.
Jørgen Bang-Jensen, Daniel Gonçalves, Inge Li Gørtz.
Discrete Optimization 4(3-4): 334-348, 2007.

Recognizing and representing proper interval graphs in parallel using merging and sorting.
Jørgen Bang-Jensen, Jing Huang, Louis Ibarra.
Discrete Applied Mathematics 155(4): 442-456, 2007.

Using median sets for inferring phylogenetic trees.
Matthias Bernt, Daniel Merkle, Martin Middendorf.
Bioinformatics 23(2): 129-135, 2007.

CREx: inferring genomic rearrangements based on common intervals.
Matthias Bernt, Daniel Merkle, Kai Ramsch, Guido Fritzsch, Marleen Perseke, Detlef Bernhard, Martin Schlegel, Peter F. Stadler, Martin Middendorf.
Bioinformatics 23(21): 2957-2958, 2007.

The relative worst order ratio for online algorithms.
Joan Boyar, Lene M. Favrholdt.
ACM Trans. Algorithms 3(2): 22, 2007.

The relative worst-order ratio applied to paging.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen.
J. Comput. Syst. Sci. 73(5): 818-843, 2007.

Engineering a cache-oblivious sorting algorithm.
Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther.
ACM Journal of Experimental Algorithmics 12: 2.2:1-2.2:23, 2007.

The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments.
Pierre Charbit, Stéphan Thomassé, Anders Yeo.
Combinatorics, Probability & Computing 16(1): 1-4, 2007.

The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo.
Theory Comput. Syst. 41(3): 521-538, 2007.

The Greedy Algorithm for the Symmetric TSP.
Gregory Z. Gutin, Anders Yeo.
Algorithmic Operations Research 2(1), 2007.

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph.
Michael A. Henning, Anders Yeo.
Graphs and Combinatorics 23(6): 647-657, 2007.

A New Upper Bound on the Total Domination Number of a Graph.
Michael A. Henning, Anders Yeo.
Electr. J. Comb. 14(1), 2007.

Total domination of graphs and small transversals of hypergraphs.
Stéphan Thomassé, Anders Yeo.
Combinatorica 27(4): 473-487, 2007.

Relationships between total domination, order, size, and maximum degree of graphs.
Anders Yeo.
Journal of Graph Theory 55(4): 325-337, 2007.

Paths and cycles containing given arcs, in close to regular multipartite tournaments.
Anders Yeo.
J. Comb. Theory, Ser. B 97(6): 949-963, 2007.

Mixed Models for the Analysis of Local Search Components.
Jørgen Bang-Jensen, Marco Chiarandini, Yuri Goegebeur, Bent Jørgensen.
SLS, Lecture Notes in Computer Science 4638: 91-105, Springer, 2007.
[Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, International Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007, Proceedings.]

Optimal sparse matrix dense vector multiplication in the I/O-model.
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari.
SPAA: 61-70, ACM, 2007.
[SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007.]

A Fast and Exact Algorithm for the Perfect Reversal Median Problem.
Matthias Bernt, Daniel Merkle, Martin Middendorf.
ISBRA, Lecture Notes in Computer Science 4463: 305-316, Springer, 2007.
[Bioinformatics Research and Applications, Third International Symposium, ISBRA 2007, Atlanta, GA, USA, May 7-10, 2007, Proceedings.]

Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts.
Philip Bille, Rolf Fagerberg, Inge Li Gørtz.
CPM, Lecture Notes in Computer Science 4580: 52-62, Springer, 2007.
[Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings.]

Optimal Resilient Dynamic Dictionaries.
Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave.
ESA, Lecture Notes in Computer Science 4698: 347-358, Springer, 2007.
[Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings.]

Swarm Controlled Emergence - Designing an Anti-Clustering Ant System.
Daniel Merkle, Martin Middendorf, Alexander Scheidler.
SIS: 242-249, IEEE, 2007.
[2007 IEEE Swarm Intelligence Symposium, SIS 2007, Honolulu, Hawaii, USA, April 1-5, 2007.]

Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees.
Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg.
APBC, Advances in Bioinformatics and Computational Biology 5: 91-100, Imperial College Press, 2007.
[Proceedings of 5th Asia-Pacific Bioinformatics Conference, APBC 2007, 15-17 January 2007, Hong Kong, China.]

Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree.
Martin Stig Stissing, Christian N. S. Pedersen, Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg.
APBC, Advances in Bioinformatics and Computational Biology 5: 101-110, Imperial College Press, 2007.
[Proceedings of 5th Asia-Pacific Bioinformatics Conference, APBC 2007, 15-17 January 2007, Hong Kong, China.]


2006

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs.
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo.
Discrete Optimization 3(1): 86-94, 2006.

Longest path partitions in generalizations of tournaments.
Jørgen Bang-Jensen, Morten Hegner Nielsen, Anders Yeo.
Discrete Mathematics 306(16): 1830-1839, 2006.

Genome Rearrangement Based on Reversals that Preserve Conserved Intervals.
Matthias Bernt, Daniel Merkle, Martin Middendorf.
IEEE/ACM Trans. Comput. Biology Bioinform. 3(3): 275-288, 2006.

The maximum resource bin packing problem.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk.
Theor. Comput. Sci. 362(1-3): 127-139, 2006.

Julius Petersen - Danish Mathematician and Cryptologist.
Augusto Buonafalce, Niels Faurholt, Bjarne Toft.
Cryptologia 30(4): 353-360, 2006.

Separating online scheduling algorithms with the relative worst order ratio.
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt.
J. Comb. Optim. 12(4): 363-386, 2006.

On-line bin Packing with Two Item Sizes.
Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo.
Algorithmic Operations Research 1(2), 2006.

Domination analysis for minimum multiprocessor scheduling.
Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo.
Discrete Applied Mathematics 154(18): 2613-2619, 2006.

Note on Upper Bounds for TSP Domination Number.
Gregory Z. Gutin, Angela Koller, Anders Yeo.
Algorithmic Operations Research 1(1), 2006.

Hamilton cycles in digraphs of unitary matrices.
Gregory Z. Gutin, Arash Rafiey, Simone Severini, Anders Yeo.
Discrete Mathematics 306(24): 3315-3320, 2006.

On n-partite Tournaments with Unique n-cycle.
Gregory Z. Gutin, Arash Rafiey, Anders Yeo.
Graphs and Combinatorics 22(2): 241-249, 2006.

Minimum cost and list homomorphisms to semicomplete digraphs.
Gregory Z. Gutin, Arash Rafiey, Anders Yeo.
Discrete Applied Mathematics 154(6): 890-897, 2006.

Level of repair analysis and minimum cost homomorphisms of graphs.
Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso.
Discrete Applied Mathematics 154(6): 881-889, 2006.

Total Domination and Matching Numbers in Claw-Free Graphs.
Michael A. Henning, Anders Yeo.
Electr. J. Comb. 13(1), 2006.

Recrafting the neighbor-joining method.
Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips.
BMC Bioinformatics 7: 29, 2006.

Marco Dorigo and Thomas Stützle, Ant Colony Optimization, MIT Press (2004) ISBN 0-262-04219-3.
Daniel Merkle, Martin Middendorf.
European Journal of Operational Research 168(1): 269-271, 2006.

Modeling Ant Brood ending Patterns with Cellular Automata.
Daniel Merkle, Martin Middendorf, Alexander Scheidler.
J. Cellular Automata 1(2): 183-194, 2006.

The Reversal Median Problem, Common Intervals, and Mitochondrial Gene Orders.
Matthias Bernt, Daniel Merkle, Martin Middendorf.
CompLife, Lecture Notes in Computer Science 4216: 52-63, Springer, 2006.
[Computational Life Sciences II, Second International Symposium, CompLife 2006, Cambridge, UK, September 27-29, 2006, Proceedings.]

Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem.
Joan Boyar, Martin R. Ehmsen, Kim S. Larsen.
WAOA, Lecture Notes in Computer Science 4368: 95-107, Springer, 2006.
[Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers.]

Scheduling Jobs on Grid Processors.
Joan Boyar, Lene M. Favrholdt.
SWAT, Lecture Notes in Computer Science 4059: 17-28, Springer, 2006.
[Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings.]

Concrete Multiplicative Complexity of Symmetric Functions.
Joan Boyar, René Peralta.
MFCS, Lecture Notes in Computer Science 4162: 179-189, Springer, 2006.
[Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings.]

Cache-oblivious string dictionaries.
Gerth Stølting Brodal, Rolf Fagerberg.
SODA: 581-590, ACM Press, 2006.
[Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006.]

Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem.
Marco Chiarandini, Thomas Stützle, Kim S. Larsen.
Hybrid Metaheuristics, Lecture Notes in Computer Science 4030: 162-177, Springer, 2006.
[Hybrid Metaheuristics, Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-15, 2006, Proceedings.]

External String Sorting: Faster and Cache-Oblivious.
Rolf Fagerberg, Anna Pagh, Rasmus Pagh.
STACS, Lecture Notes in Computer Science 3884: 68-79, Springer, 2006.
[STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings.]

The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo.
CIAC, Lecture Notes in Computer Science 3998: 356-367, Springer, 2006.
[Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings.]

Fixed-Parameter Complexity of Minimum Profile Problems.
Gregory Z. Gutin, Stefan Szeider, Anders Yeo.
IWPEC, Lecture Notes in Computer Science 4169: 60-71, Springer, 2006.
[Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings.]

Using Decentralized Clustering for Task Allocation in Networks with Reconfigurable Helper Units.
Daniel Merkle, Martin Middendorf, Alexander Scheidler.
IWSOS/EuroNGI, Lecture Notes in Computer Science 4124: 137-147, Springer, 2006.
[Self-Organizing Systems, First International Workshop, IWSOS 2006, and Third International Workshop on New Trends in Network Architectures and Services, EuroNGI 2006, Passau, Germany, September 18-20, 2006, Proceedings.]

Self-organized task allocation for computing systems with reconfigurable components.
Daniel Merkle, Martin Middendorf, Alexander Scheidler.
IPDPS, IEEE, 2006.
[20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Proceedings, 25-29 April 2006, Rhodes Island, Greece.]


2005

Deeply asymmetric planar graphs.
V. A. Aksionov, Oleg V. Borodin, Leonid S. Melnikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft.
J. Comb. Theory, Ser. B 95(1): 68-78, 2005.

On paging with locality of reference.
Susanne Albers, Lene M. Favrholdt, Oliver Giel.
J. Comput. Syst. Sci. 70(2): 145-175, 2005.

Finding complementary cycles in locally semicomplete digraphs.
Jørgen Bang-Jensen, Morten Hegner Nielsen.
Discrete Applied Mathematics 146(3): 245-256, 2005.

A problem of finding an acceptable variant in generalized project networks.
David Blokh, Gregory Z. Gutin, Anders Yeo.
JAMDS 9(2): 75-81, 2005.

The Exact Multiplicative Complexity of the Hamming Weight Function
Joan Boyar, René Peralta.
Electronic Colloquium on Computational Complexity (ECCC)(049), 2005.

Optimal non-preemptive semi-online scheduling on two related machines.
Leah Epstein, Lene M. Favrholdt.
J. Algorithms 57(1): 49-73, 2005.

Batched bin packing.
Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo.
Discrete Optimization 2(1): 71-82, 2005.

Mediated digraphs and quantum nonlocality.
Gregory Z. Gutin, N. Jones, Arash Rafiey, Simone Severini, Anders Yeo.
Discrete Applied Mathematics 150(1-3): 41-50, 2005.

Kernels in planar digraphs.
Gregory Z. Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo.
J. Comput. Syst. Sci. 71(2): 174-184, 2005.

Exponentially decreasing number of operations in balanced trees.
Lars Jacobsen, Kim S. Larsen.
Acta Inf. 42(1): 57-78, 2005.

Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture.
Ken-ichi Kawarabayashi, Michael D. Plummer, Bjarne Toft.
J. Comb. Theory, Ser. B 95(1): 152-167, 2005.

Any 7-Chromatic Graphs Has K7 Or K4, 4 As A Minor.
Ken-ichi Kawarabayashi, Bjarne Toft.
Combinatorica 25(3): 327-353, 2005.

On-line seat reservations via off-line seating arrangements.
Jens S. Kohrt, Kim S. Larsen.
Int. J. Found. Comput. Sci. 16(2): 381-397, 2005.

Swarm Intelligence - An Optimization-Based Introduction.
Daniel Merkle, Christian Blum.
KI 19(4): 5-10, 2005.

Reconstruction of the cophylogenetic history of related phylogenetic trees with divergence timing information.
Daniel Merkle, Martin Middendorf.
Theory in Biosciences 123(4): 277-299, 2005.

On solving permutation scheduling problems with ant colony optimization.
Daniel Merkle, Martin Middendorf.
Int. J. Systems Science 36(5): 255-266, 2005.

Decentralized packet clustering in router-based networks.
Daniel Merkle, Martin Middendorf, Alexander Scheidler.
Int. J. Found. Comput. Sci. 16(2): 321-341, 2005.

The number of pancyclic arcs in a k-strong tournament.
Anders Yeo.
Journal of Graph Theory 50(3): 212-219, 2005.

Cache-oblivious planar orthogonal range searching and counting.
Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen.
Symposium on Computational Geometry: 160-169, ACM, 2005.
[Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005.]

Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs.
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo.
ACiD, Texts in Algorithmics 4: 81-94, King's College, London, 2005.
[Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK.]

A Parallel Algorithm for Solving the Reversal Median Problem.
Matthias Bernt, Daniel Merkle, Martin Middendorf.
PPAM, Lecture Notes in Computer Science 3911: 1089-1096, Springer, 2005.
[Parallel Processing and Applied Mathematics, 6th International Conference, PPAM 2005, Poznan, Poland, September 11-14, 2005, Revised Selected Papers.]

The Maximum Resource Bin Packing Problem.
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk.
FCT, Lecture Notes in Computer Science 3623: 397-408, Springer, 2005.
[Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings.]

The relative worst order ratio applied to paging.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen.
SODA: 718-727, SIAM, 2005.
[Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005.]

Cache-Aware and Cache-Oblivious Adaptive Sorting.
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz.
ICALP, Lecture Notes in Computer Science 3580: 576-588, Springer, 2005.
[Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings.]

On the Adaptiveness of Quicksort.
Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz.
ALENEX/ANALCO: 130-140, SIAM, 2005.
[Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005.]

Optimal On-Line Bin Packing with Two Item Sizes.
Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo.
ACiD, Texts in Algorithmics 4: 95-103, King's College, London, 2005.
[Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK.]

Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs.
Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso.
AAIM, Lecture Notes in Computer Science 3521: 427-439, Springer, 2005.
[Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings.]

A New Multi-objective Particle Swarm Optimization Algorithm Using Clustering Applied to Automated Docking.
Stefan Janson, Daniel Merkle.
Hybrid Metaheuristics, Lecture Notes in Computer Science 3636: 128-141, Springer, 2005.
[Hybrid Metaheuristics, Second International Workshop, HM 2005, Barcelona, Spain, August 29-30, 2005, Proceedings.]

Modelling Ant Brood Tending Behavior with Cellular Automata.
Daniel Merkle, Martin Middendorf, Alexander Scheidler.
International Conference on Computational Science (2), Lecture Notes in Computer Science 3515: 412-419, Springer, 2005.
[Computational Science - ICCS 2005, 5th International Conference, Atlanta, GA, USA, May 22-25, 2005, Proceedings, Part II.]

Dynamic Decentralized Packet Clustering in Networks.
Daniel Merkle, Martin Middendorf, Alexander Scheidler.
EvoWorkshops, Lecture Notes in Computer Science 3449: 574-583, Springer, 2005.
[Applications of Evolutionary Computing, EvoWorkshops 2005: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC, Lausanne, Switzerland, March 30 - April 1, 2005, Proceedings.]


2004

The structure of strong arc-locally semicomplete digraphs.
Jørgen Bang-Jensen.
Discrete Mathematics 283(1-3): 1-6, 2004.

Spanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments.
Jørgen Bang-Jensen, Jing Huang, Anders Yeo.
Journal of Graph Theory 46(4): 265-284, 2004.

Subgraphs in vertex neighborhoods of Kr-free graphs.
Jørgen Bang-Jensen, Stephan Brandt.
Journal of Graph Theory 47(1): 29-38, 2004.

When the greedy algorithm fails.
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo.
Discrete Optimization 1(2): 121-127, 2004.

Splitting off edges between two subsets preserving the edge-connectivity of the graph.
Jørgen Bang-Jensen, Tibor Jordán.
Discrete Mathematics 276(1-3): 5-28, 2004.

Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs.
Jørgen Bang-Jensen, Anders Yeo.
Combinatorica 24(3): 331-349, 2004.

Making a tournament k-arc-strong by reversing or deorienting arcs.
Jørgen Bang-Jensen, Anders Yeo.
Discrete Applied Mathematics 136(2-3): 161-171, 2004.

Seat reservation allowing seat changes.
Joan Boyar, Susan Krarup, Morten N. Nielsen.
J. Algorithms 52(2): 169-192, 2004.

Computing the Quartet Distance between Evolutionary Trees in Time O(n log n).
Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen.
Algorithmica 38(2): 377-395, 2004.

On the number of quasi-kernels in digraphs.
Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo.
Journal of Graph Theory 46(1): 48-56, 2004.

Dynamic Polyethism and Competition for Tasks in Threshold Reinforcement Models of Social Insects.
Daniel Merkle, Martin Middendorf.
Adaptive Behaviour 12(3-4): 251-262, 2004.

Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments.
Lutz Volkmann, Anders Yeo.
Discrete Mathematics 281(1-3): 267-276, 2004.

Priority Algorithms for Graph Optimization Problems.
Allan Borodin, Joan Boyar, Kim S. Larsen.
WAOA, Lecture Notes in Computer Science 3351: 126-139, Springer, 2004.
[Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers.]

The Relative Worst Order Ratio Applied to Seat Reservation.
Joan Boyar, Paul Medvedev.
SWAT, Lecture Notes in Computer Science 3111: 90-101, Springer, 2004.
[Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings.]

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.
Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh.
SWAT, Lecture Notes in Computer Science 3111: 480-492, Springer, 2004.
[Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings.]

Engineering a Cache-Oblivious Sorting Algorith.
Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther.
ALENEX/ANALC: 4-17, SIAM, 2004.
[Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, USA, January 10, 2004.]

Competition Controlled Pheromone Update for Ant Colony Optimization.
Daniel Merkle, Martin Middendorf.
ANTS Workshop, Lecture Notes in Computer Science 3172: 95-105, Springer, 2004.
[Ant Colony Optimization and Swarm Intelligence, 4th International Workshop, ANTS 2004, Brussels, Belgium, September 5 - 8, 2004, Proceedings.]

Decentralized Packet Clustering in Networks.
Daniel Merkle, Martin Middendorf, Alexander Scheidler.
IPDPS, IEEE Computer Society, 2004.
[18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA.]

Balanced Binary Search Trees.
Arne Andersson, Rolf Fagerberg, Kim S. Larsen.
Handbook of Data Structures and Applications, 2004.

Cache-Oblivious Data Structures.
Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg.
Handbook of Data Structures and Applications, 2004.


2003

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee.
J. Scheduling 6(2): 131-147, 2003.

Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs.
Jørgen Bang-Jensen, Jing Huang, Anders Yeo.
SIAM J. Discrete Math. 16(2): 335-343, 2003.

Steiner type problems for digraphs that are locally semicomplete or extended semicomplete.
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo.
Journal of Graph Theory 44(3): 193-207, 2003.

Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs.
Jørgen Bang-Jensen, Stéphan Thomassé.
Discrete Applied Mathematics 131(2): 555-559, 2003.

Small degree out-branchings.
Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo.
Journal of Graph Theory 42(4): 297-307, 2003.

Transformations of generalized ATSP into ATSP.
David Ben-Arieh, Gregory Z. Gutin, M. Penn, Anders Yeo, Alexey Zverovich.
Oper. Res. Lett. 31(3): 357-365, 2003.

Extending the accommodating function.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen.
Acta Inf. 40(1): 3-35, 2003.

Packing paths in digraphs.
Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo.
Journal of Graph Theory 44(2): 81-94, 2003.

On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
Leah Epstein, Lene M. Favrholdt.
Acta Cybern. 16(1): 57-66, 2003.

On-Line Edge-Coloring with a Fixed Number of Colors.
Lene M. Favrholdt, Morten N. Nielsen.
Algorithmica 35(2): 176-191, 2003.

Dynamic TCP acknowledgment in the LogP model.
Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut.
J. Algorithms 48(2): 407-428, 2003.

Domination analysis of combinatorial optimization problems.
Gregory Z. Gutin, Alek Vainshtein, Anders Yeo.
Discrete Applied Mathematics 129(2-3): 513-520, 2003.

Assignment problem based algorithms are impractical for the generalized TSP.
Gregory Z. Gutin, Anders Yeo.
Australasian J. Combinatorics 27: 149-154, 2003.

Upper bounds on ATSP neighborhood size.
Gregory Z. Gutin, Anders Yeo.
Discrete Applied Mathematics 129(2-3): 533-538, 2003.

On Enforced Convergence of ACO and its Implementation on the Reconfigurable Mesh Architecture Using Size Reduction Tasks.
Stefan Janson, Daniel Merkle, Martin Middendorf, Hossam A. ElGindy, Hartmut Schmeck.
The Journal of Supercomputing 26(3): 221-238, 2003.

Relaxed multi-way trees with group updates.
Kim S. Larsen.
J. Comput. Syst. Sci. 66(4): 657-670, 2003.

Ant Colony Optimization with Global Pheromone Evaluation for Scheduling a Single Machine.
Daniel Merkle, Martin Middendorf.
Appl. Intell. 18(1): 105-111, 2003.

On a special case of Hadwiger's conjecture.
Michael D. Plummer, Michael Stiebitz, Bjarne Toft.
Discussiones Mathematicae Graph Theory 23(2): 333-363, 2003.

The Cost of Cache-Oblivious Searching.
Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz.
FOCS: 271-282, IEEE Computer Society, 2003.
[44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings.]

The Relative Worst Order Ratio for On-Line Algorithms.
Joan Boyar, Lene M. Favrholdt.
CIAC, Lecture Notes in Computer Science 2653: 58-69, Springer, 2003.
[Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings.]

On the limits of cache-obliviousness.
Gerth Stølting Brodal, Rolf Fagerberg.
STOC: 307-315, ACM, 2003.
[Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA.]

Lower bounds for external memory dictionaries.
Gerth Stølting Brodal, Rolf Fagerberg.
SODA: 546-554, ACM/SIAM, 2003.
[Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA..]

Computing Refined Buneman Trees in Cubic Time.
Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao.
WABI, Lecture Notes in Computer Science 2812: 259-270, Springer, 2003.
[Algorithms in Bioinformatics, Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003, Proceedings.]

Online Seat Reservations via Offine Seating Arrangements.
Jens S. Frederiksen, Kim S. Larsen.
WADS, Lecture Notes in Computer Science 2748: 174-185, Springer, 2003.
[Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings.]


2002

Pushing vertices in digraphs without long induced cycles.
Jing Huang, Gary MacGillivray, Anders Yeo.
Discrete Applied Mathematics 121(1-3): 181-192, 2002.

Fair versus Unrestricted Bin Packing.
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein.
Algorithmica 34(2): 181-196, 2002.

Convex-round graphs are circular-perfect.
Jørgen Bang-Jensen, Jing Huang.
Journal of Graph Theory 40(3): 182-194, 2002.

Optimal preemptive semi-online scheduling to minimize makespan on two related machines.
Leah Epstein, Lene M. Favrholdt.
Oper. Res. Lett. 30(4): 269-275, 2002.

Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs.
Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo.
Graphs and Combinatorics 18(3): 499-506, 2002.

Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number.
Gregory Z. Gutin, Anders Yeo.
Discrete Applied Mathematics 119(1-2): 107-116, 2002.

Orientations of digraphs almost preserving diameter.
Gregory Z. Gutin, Anders Yeo.
Discrete Applied Mathematics 121(1-3): 129-138, 2002.

Anti-matroids.
Gregory Z. Gutin, Anders Yeo.
Oper. Res. Lett. 30(2): 97-99, 2002.

Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP.
Gregory Z. Gutin, Anders Yeo, Alexey Zverovich.
Discrete Applied Mathematics 117(1-3): 81-86, 2002.

On the existence and construction of non-extreme (a, b)-trees.
Lars Jacobsen, Kim S. Larsen, Morten N. Nielsen.
Inf. Process. Lett. 84(2): 69-73, 2002.

Relaxed red-black trees with group updates.
Kim S. Larsen.
Acta Inf. 38(8): 565-586, 2002.

Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays.
Daniel Merkle, Martin Middendorf.
Genetic Programming and Evolvable Machines 3(4): 345-361, 2002.

Modeling the Dynamics of Ant Colony Optimization.
Daniel Merkle, Martin Middendorf.
Evolutionary Computation 10(3): 235-262, 2002.

Ant colony optimization for resource-constrained project scheduling.
Daniel Merkle, Martin Middendorf, Hartmut Schmeck.
IEEE Trans. Evolutionary Computation 6(4): 333-346, 2002.

Formal language recognition by stochastic cellular automata.
Daniel Merkle, Thomas Worsch.
Fundam. Inform. 52(1-3): 183-201, 2002.

Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic.
Meike Tewes, Lutz Volkmann, Anders Yeo.
Discrete Mathematics 242(1-3): 201-228, 2002.

On paging with locality of reference.
Susanne Albers, Lene M. Favrholdt, Oliver Giel.
STOC: 258-267, ACM, 2002.
[Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada.]

Extending the Accommodating Function.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen.
COCOON, Lecture Notes in Computer Science 2387: 87-96, Springer, 2002.
[Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings.]

Coevolutionary Ant Algorithms Playing Games.
Jürgen Branke, Michael Decker, Daniel Merkle, Hartmut Schmeck.
Ant Algorithms, Lecture Notes in Computer Science 2463: 298-299, Springer, 2002.
[Ant Algorithms, Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002, Proceedings.]

Funnel Heap - A Cache Oblivious Priority Queue.
Gerth Stølting Brodal, Rolf Fagerberg.
ISAAC, Lecture Notes in Computer Science 2518: 219-228, Springer, 2002.
[Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings.]

Cache Oblivious Distribution Sweeping.
Gerth Stølting Brodal, Rolf Fagerberg.
ICALP, Lecture Notes in Computer Science 2380: 426-438, Springer, 2002.
[Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings.]

Cache oblivious search trees via binary trees of small height.
Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob.
SODA: 39-48, ACM/SIAM, 2002.
[Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA..]

Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.
Leah Epstein, Lene M. Favrholdt.
MFCS, Lecture Notes in Computer Science 2420: 245-256, Springer, 2002.
[Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings.]

On-Line Maximizing the Number of Items Packed in Variable-Sized Bins.
Leah Epstein, Lene M. Favrholdt.
COCOON, Lecture Notes in Computer Science 2387: 467-475, Springer, 2002.
[Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings.]

Packet Bundling.
Jens S. Frederiksen, Kim S. Larsen.
SWAT, Lecture Notes in Computer Science 2368: 328-337, Springer, 2002.
[Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings.]

Ant Colony Optimization with the Relative Pheromone Evaluation Method.
Daniel Merkle, Martin Middendorf.
EvoWorkshops, Lecture Notes in Computer Science 2279: 325-333, Springer, 2002.
[Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings.]

Studies On The Dynamics Of Ant Colony Optimization Algorithms.
Daniel Merkle, Martin Middendorf.
GECCO: 105-112, Morgan Kaufmann, 2002.
[GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, USA, 9-13 July 2002.]

Modelling ACO: Composed Permutation Problems.
Daniel Merkle, Martin Middendorf.
Ant Algorithms, Lecture Notes in Computer Science 2463: 149-162, Springer, 2002.
[Ant Algorithms, Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002, Proceedings.]

Digraphs - theory, algorithms and applications.
Jørgen Bang-Jensen, Gregory Z. Gutin.
Springer, 2002.

Ameisenalgorithmen: Optimierung und Modellierung.
Daniel Merkle.
Karlsruhe Institute of Technology, Germany, 2002.


2001

The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs.
Jørgen Bang-Jensen, Anders Yeo.
J. Algorithms 41(1): 1-19, 2001.

Making a tournament k-arc-strong by reversing arcs.
Jørgen Bang-Jensen, Anders Yeo.
Electronic Notes in Discrete Mathematics 8: 2-5, 2001.

The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences.
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen.
Nord. J. Comput. 8(4): 463-472, 2001.

Seat Reservation Allowing Seat Changes.
Joan Boyar, Susan Krarup, Morten N. Nielsen.
Electr. Notes Theor. Comput. Sci. 50(1): 24-38, 2001.

The Accommodating Function: A Generalization of the Competitive Ratio.
Joan Boyar, Kim S. Larsen, Morten N. Nielsen.
SIAM J. Comput. 31(1): 233-258, 2001.

Construction heuristics for the asymmetric TSP.
Fred Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich.
European Journal of Operational Research 129(3): 555-568, 2001.

Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs.
Gregory Z. Gutin, Anders Yeo.
Graphs and Combinatorics 17(3): 473-477, 2001.

Remarks on hamiltonian digraphs.
Gregory Z. Gutin, Anders Yeo.
Australasian J. Combinatorics 23: 115-118, 2001.

TSP tour domination and Hamilton cycle decompositions of regular digraphs.
Gregory Z. Gutin, Anders Yeo.
Oper. Res. Lett. 28(3): 107-111, 2001.

Variants of (A, B)-Trees with Relaxed Balance.
Lars Jacobsen, Kim S. Larsen.
Int. J. Found. Comput. Sci. 12(4): 455-478, 2001.

25 Pretty graph colouring problems.
Tommy R. Jensen, Bjarne Toft.
Discrete Mathematics 229(1-3): 167-169, 2001.

Relaxed balance for search trees with local rebalancing.
Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen.
Acta Inf. 37(10): 743-763, 2001.

Relaxed Balance Using Standard Rotations.
Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer.
Algorithmica 31(4): 501-512, 2001.

Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n).
Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen.
ISAAC, Lecture Notes in Computer Science 2223: 731-742, Springer, 2001.
[Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings.]

The Complexity of Constructing Evolutionary Trees Using Experiments.
Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin.
ICALP, Lecture Notes in Computer Science 2076: 140-151, Springer, 2001.
[Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings.]

Search Trees with Relaxed Balance and Near-Optimal Height.
Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen.
WADS, Lecture Notes in Computer Science 2125: 414-425, Springer, 2001.
[Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings.]

Bi-Criterion Optimization with Multi Colony Ant Algorithms.
Steffen Iredi, Daniel Merkle, Martin Middendorf.
EMO, Lecture Notes in Computer Science 1993: 359-372, Springer, 2001.
[Evolutionary Multi-Criterion Optimization, First International Conference, EMO 2001, Zurich, Switzerland, March 7-9, 2001, Proceedings.]

Complexity of Layered Binary Search Trees with Relaxed Balance.
Lars Jacobsen, Kim S. Larsen.
ICTCS, Lecture Notes in Computer Science 2202: 269-284, Springer, 2001.
[Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings.]

Exponentially Decreasing Number of Operations in Balanced Trees.
Lars Jacobsen, Kim S. Larsen.
ICTCS, Lecture Notes in Computer Science 2202: 293-311, Springer, 2001.
[Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings.]

Relaxed Multi-Way Trees with Group Updates.
Kim S. Larsen.
PODS, ACM, 2001.
[Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 21-23, 2001, Santa Barbara, California, USA.]

A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization.
Daniel Merkle, Martin Middendorf.
EvoWorkshops, Lecture Notes in Computer Science 2037: 484-494, Springer, 2001.
[Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18-20, 2001, Proceedings.]

Fast ant colony optimization on reconfigurable processor arrays.
Daniel Merkle, Martin Middendorf.
IPDPS: 144, IEEE Computer Society, 2001.
[Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), San Francisco, CA, USA, April 23-27, 2001.]


2000

Problems concerning global connectivity of directed graphs.
Jørgen Bang-Jensen.
Electronic Notes in Discrete Mathematics 5: 15-18, 2000.

Convex-Round and Concave-Round Graphs.
Jørgen Bang-Jensen, Jing Huang, Anders Yeo.
SIAM J. Discrete Math. 13(2): 179-193, 2000.

Complementary cycles containing prescribed vertices in tournaments.
Jørgen Bang-Jensen, Yubao Guo, Anders Yeo.
Discrete Mathematics 214(1-3): 77-87, 2000.

Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph.
Jørgen Bang-Jensen, Tibor Jordán.
J. Algorithms 37(2): 326-343, 2000.

Variable degeneracy: extensions of Brooks' and Gallai's theorems.
Oleg V. Borodin, Alexandr V. Kostochka, Bjarne Toft.
Discrete Mathematics 214(1-3): 101-112, 2000.

Short Non-Interactive Cryptographic Proofs.
Joan Boyar, Ivan Damgård, René Peralta.
J. Cryptology 13(4): 449-472, 2000.

On the multiplicative complexity of Boolean functions over the basis (cap, +, 1).
Joan Boyar, René Peralta, Denis Pochuev.
Theor. Comput. Sci. 235(1): 43-57, 2000.

Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.
Yubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo.
Discrete Mathematics 212(1-2): 91-100, 2000.

On the Hajo's number of graphs.
Gregory Z. Gutin, Alexandr V. Kostochka, Bjarne Toft.
Discrete Mathematics 213(1-3): 153-161, 2000.

Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs.
Gregory Z. Gutin, Meike Tewes, Anders Yeo.
Discrete Mathematics 222(1-3): 269-274, 2000.

Kings in semicomplete multipartite digraphs.
Gregory Z. Gutin, Anders Yeo.
Journal of Graph Theory 33(3): 177-183, 2000.

Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian.
Gregory Z. Gutin, Anders Yeo.
J. Comb. Theory, Ser. B 78(2): 232-242, 2000.

AVL Trees with Relaxed Balance.
Kim S. Larsen.
J. Comput. Syst. Sci. 61(3): 508-522, 2000.

Fair versus Unrestricted Bin Packing.
Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen.
SWAT, Lecture Notes in Computer Science 1851: 200-213, Springer, 2000.
[Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings.]

Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.
Eric Bach, Joan Boyar, Tao Jiang, Kim S. Larsen, Guo-Hui Lin.
COCOON, Lecture Notes in Computer Science 1858: 221-231, Springer, 2000.
[Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings.]

On-Line Edge-Coloring with a Fixed Number of Colors.
Lene M. Favrholdt, Morten N. Nielsen.
FSTTCS, Lecture Notes in Computer Science 1974: 106-116, Springer, 2000.
[Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, Proceedings..]

An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems.
Daniel Merkle, Martin Middendorf.
EvoWorkshops, Lecture Notes in Computer Science 1803: 287-296, Springer, 2000.
[Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight, Edinburgh, Scotland, UK, April 17, 2000, Proceedings.]

Ant Colony Optimization for Resource-Constrained Projet Scheduling.
Daniel Merkle, Martin Middendorf, Hartmut Schmeck.
GECCO: 893-, Morgan Kaufmann, 2000.
[Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '00), Las Vegas, Nevada, USA, July 8-12, 2000.]


1999

Linkages in locally semicomplete digraphs and quasi-transitive digraphs.
Jørgen Bang-Jensen.
Discrete Mathematics 196(1-3): 13-27, 1999.

Edge-Connectivity Augmentation with Partition Constraints.
Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti.
SIAM J. Discrete Math. 12(2): 160-207, 1999.

A note on vertex pancyclic oriented graphs.
Jørgen Bang-Jensen, Yubao Guo.
Journal of Graph Theory 31(4): 313-318, 1999.

A New Sufficient Condition for a Digraph to Be Hamiltonian.
Jørgen Bang-Jensen, Yubao Guo, Anders Yeo.
Discrete Applied Mathematics 95(1-3): 61-72, 1999.

On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs.
Jørgen Bang-Jensen, Gregory Z. Gutin.
Discrete Applied Mathematics 95(1-3): 41-60, 1999.

Augmenting hypergraphs by edges of size two.
Jørgen Bang-Jensen, Bill Jackson.
Math. Program. 84(3): 467-481, 1999.

The Seat Reservation Problem.
Joan Boyar, Kim S. Larsen.
Algorithmica 25(4): 403-417, 1999.

Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour.
Gregory Z. Gutin, Anders Yeo.
Computers & OR 26(4): 321-327, 1999.

Partially persistent search trees with transcript operations.
Kim S. Larsen.
Discrete Mathematics & Theoretical Computer Science 3(3): 95-107, 1999.

On Grouping in Relational Algebra.
Kim S. Larsen.
Int. J. Found. Comput. Sci. 10(3): 301-311, 1999.

Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5.
Anders Yeo.
Journal of Graph Theory 32(2): 137-152, 1999.

Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments.
Anders Yeo.
Journal of Graph Theory 32(2): 123-136, 1999.

A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph.
Anders Yeo.
J. Algorithms 33(1): 124-139, 1999.

How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?
Anders Yeo.
Graphs and Combinatorics 15(4): 481-493, 1999.

The Accommodating Function - A Generalization of the Competitive Ratio.
Joan Boyar, Kim S. Larsen, Morten N. Nielsen.
WADS, Lecture Notes in Computer Science 1663: 74-79, Springer, 1999.
[Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings.]

Dynamic Representation of Sparse Graphs.
Gerth Stølting Brodal, Rolf Fagerberg.
WADS, Lecture Notes in Computer Science 1663: 342-351, Springer, 1999.
[Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings.]

The Complexity of Rebalancing a Binary Search Tree.
Rolf Fagerberg.
FSTTCS, Lecture Notes in Computer Science 1738: 72-83, Springer, 1999.
[Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings.]

Construction Heuristics and Domination Analysis for the Asymmetric TSP.
Fred Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich.
Algorithm Engineering, Lecture Notes in Computer Science 1668: 85-94, Springer, 1999.
[Algorithm Engineering, 3rd International Workshop, WAE '99, London, UK, July 19-21, 1999, Proceedings.]


1998

Kings in quasi-transitive digraphs.
Jørgen Bang-Jensen, Jing Huang.
Discrete Mathematics 185(1-3): 19-27, 1998.

Generalizations of tournaments: A survey.
Jørgen Bang-Jensen, Gregory Z. Gutin.
Journal of Graph Theory 28(4): 171-202, 1998.

Alternating cycles and trails in 2-edge-coloured complete multigraphs.
Jørgen Bang-Jensen, Gregory Z. Gutin.
Discrete Mathematics 188(1-3): 61-72, 1998.

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs.
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo.
Journal of Graph Theory 29(2): 111-132, 1998.

Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs.
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo.
Discrete Applied Mathematics 82(1-3): 247-250, 1998.

Edge-Connectivity Augmentation Preserving Simplicity.
Jørgen Bang-Jensen, Tibor Jordán.
SIAM J. Discrete Math. 11(4): 603-623, 1998.

Adding and Reversing Arcs in Semicomplete Digraphs.
Jørgen Bang-Jensen, Tibor Jordán.
Combinatorics, Probability & Computing 7(1): 17-25, 1998.

Note on alternating directed cycles.
Gregory Z. Gutin, Benny Sudakov, Anders Yeo.
Discrete Mathematics 191(1-3): 101-107, 1998.

On interval colourings of bi-regular bipartite graphs.
Denis Hanson, C. O. M. Loten, Bjarne Toft.
Ars Comb. 50, 1998.

Maximal and Minimal Vertex-Critical Graphs of Diameter Two.
Jing Huang, Anders Yeo.
J. Comb. Theory, Ser. B 74(2): 311-325, 1998.

Parametric Permutation Routing via Matchings.
Peter Høyer, Kim S. Larsen.
Nord. J. Comput. 5(2): 105-114, 1998.

Amortized Constant Relaxed Rebalancing Using Standard Rotations.
Kim S. Larsen.
Acta Inf. 35(10): 859-874, 1998.

Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy.
Kim S. Larsen.
Inf. Process. Lett. 65(4): 169-172, 1998.

Sort Order Problems in Relational Databases.
Kim S. Larsen.
Int. J. Found. Comput. Sci. 9(4): 399-430, 1998.

Edge-Connectivity Augmentation with Partition Constraints.
Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti.
SODA: 306-315, ACM/SIAM, 1998.
[Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California, USA..]

Partially Persistent Search Trees with Transcript Operations.
Kim S. Larsen.
STACS, Lecture Notes in Computer Science 1373: 309-319, Springer, 1998.
[STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings.]


1997

A classification of locally semicomplete digraphs.
Jørgen Bang-Jensen, Yubao Guo, Gregory Z. Gutin, Lutz Volkmann.
Discrete Mathematics 167-168: 101-114, 1997.

Alternating cycles and paths in edge-coloured multigraphs: A survey.
Jørgen Bang-Jensen, Gregory Z. Gutin.
Discrete Mathematics 165-166: 39-60, 1997.

Vertex heaviest paths and cycles in quasi-transitive digraphs.
Jørgen Bang-Jensen, Gregory Z. Gutin.
Discrete Mathematics 163(1-3): 217-223, 1997.

Paths and cycles in extended and decomposable digraphs, .
Jørgen Bang-Jensen, Gregory Z. Gutin.
Discrete Mathematics 164(1-3): 5-19, 1997.

Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments.
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo.
Combinatorics, Probability & Computing 6(3): 255-261, 1997.

Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs.
Jørgen Bang-Jensen, Mohamed El Haddad, Yannis Manoussakis, Teresa M. Przytycka.
Algorithmica 17(1): 67-87, 1997.

Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
Joan Boyar, Rolf Fagerberg, Kim S. Larsen.
J. Comput. Syst. Sci. 55(3): 504-521, 1997.

One-diregular subgraphs in semicomplete multipartite digraphs.
Anders Yeo.
Journal of Graph Theory 24(2): 175-185, 1997.

A Note on Alternating Cycles in Edge-Coloured Graphs.
Anders Yeo.
J. Comb. Theory, Ser. B 69(2): 222-225, 1997.

Edge-Connectivity Augmentation Preserving Simplicity.
Jørgen Bang-Jensen, Tibor Jordán.
FOCS: 486-495, IEEE Computer Society, 1997.
[38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997.]

Relaxed Balance for Search Trees with Local Rebalancing.
Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen.
ESA, Lecture Notes in Computer Science 1284: 350-363, Springer, 1997.
[Algorithms - ESA '97, 5th Annual European Symposium, Graz, Austria, September 15-17, 1997, Proceedings.]

Relaxed Balance through Standard Rotations.
Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer.
WADS, Lecture Notes in Computer Science 1272: 450-461, Springer, 1997.
[Algorithms and Data Structures, 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings.]


1996

Weakly Hamiltonian-connected locally semicomplete digraphs.
Jørgen Bang-Jensen, Yubao Guo, Lutz Volkmann.
Journal of Graph Theory 21(2): 163-172, 1996.

A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian.
Jørgen Bang-Jensen, Gregory Z. Gutin, Jing Huang.
Discrete Mathematics 161(1-3): 1-12, 1996.

Sufficient conditions for a digraph to be Hamiltonian.
Jørgen Bang-Jensen, Gregory Z. Gutin, Hao Li.
Journal of Graph Theory 22(2): 181-187, 1996.

On k-strong and k-cyclic digraphs.
Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo.
Discrete Mathematics 162(1-3): 1-11, 1996.

A Generalization of Binomial Queues.
Rolf Fagerberg.
Inf. Process. Lett. 57(2): 109-114, 1996.

Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph.
Gregory Z. Gutin, Anders Yeo.
Discrete Applied Mathematics 69(1-2): 75-82, 1996.

Choosability of bipartite graphs.
Denis Hanson, Gary MacGillivray, Bjarne Toft.
Ars Comb. 44, 1996.

Efficient Rebalancing of B-Trees with Relaxed Balance.
Kim S. Larsen, Rolf Fagerberg.
Int. J. Found. Comput. Sci. 7(2): 169-186, 1996.

Short Discrete Proofs.
Joan Boyar, René Peralta.
EUROCRYPT, Lecture Notes in Computer Science 1070: 131-142, Springer, 1996.
[Advances in Cryptology - EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12-16, 1996, Proceeding.]

Binary Search Trees: How Low Can You Go?
Rolf Fagerberg.
SWAT, Lecture Notes in Computer Science 1097: 428-439, Springer, 1996.
[Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings.]


1995

Digraphs with the path-merging property.
Jørgen Bang-Jensen.
Journal of Graph Theory 20(2): 255-265, 1995.

Quasi-transitive digraphs.
Jørgen Bang-Jensen, Jing Huang.
Journal of Graph Theory 20(2): 141-161, 1995.

Preserving and Increasing Local Edge-Connectivity in Mixed Graphs.
Jørgen Bang-Jensen, András Frank, Bill Jackson.
SIAM J. Discrete Math. 8(2): 155-178, 1995.

Weakly Hamiltonian-connected ordinary multipartite tournaments.
Jørgen Bang-Jensen, Gregory Z. Gutin, Jing Huang.
Discrete Mathematics 138(1-3): 63-74, 1995.

Hereditarily hard H-colouring problems.
Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray.
Discrete Mathematics 138(1-3): 75-92, 1995.

Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments.
Jørgen Bang-Jensen, Yannis Manoussakis.
J. Comb. Theory, Ser. B 63(2): 261-280, 1995.

Subquadratic Zero-Knowledge.
Joan Boyar, Gilles Brassard, René Peralta.
J. ACM 42(6): 1169-1193, 1995.

An Abstract Generalization of a Map Reduction Theorem of Birkhoff.
Michael Stiebitz, Bjarne Toft.
J. Comb. Theory, Ser. B 65(2): 165-185, 1995.

Amortization Results for Chromatic Search Trees, with an Application to Priority Queues.
Joan Boyar, Rolf Fagerberg, Kim S. Larsen.
WADS, Lecture Notes in Computer Science 955: 270-281, Springer, 1995.
[Algorithms and Data Structures, 4th International Workshop, WADS '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings.]

Efficient Simplification of Bisimulation Formulas.
Uffe Engberg, Kim S. Larsen.
TACAS, Lecture Notes in Computer Science 1019: 111-132, Springer, 1995.
[Tools and Algorithms for Construction and Analysis of Systems, First International Workshop, TACAS '95, Aarhus, Denmark, May 19-20, 1995, Proceedings.]

B-trees with relaxed balance.
Kim S. Larsen, Rolf Fagerberg.
IPPS: 196-202, IEEE Computer Society, 1995.
[Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA.]


1994

On chordal proper circular arc graphs.
Jørgen Bang-Jensen, Pavol Hell.
Discrete Mathematics 128(1-3): 395-398, 1994.

Cycles Through k Vertices in Bipartite Tournaments.
Jørgen Bang-Jensen, Yannis Manoussakis.
Combinatorica 14(2): 243-246, 1994.

Bounds on Certain Multiplications of Affine Combinations.
Joan Boyar, Faith E. Fich, Kim S. Larsen.
Discrete Applied Mathematics 52(2): 155-167, 1994.

Efficient Rebalancing of Chromatic Search Trees.
Joan Boyar, Kim S. Larsen.
J. Comput. Syst. Sci. 49(3): 667-682, 1994.

Injectivity of Composite Functions.
Kim S. Larsen, Michael I. Schwartzbach.
J. Symb. Comput. 17(5): 393-408, 1994.

AVL Trees with Relaxed Balance.
Kim S. Larsen.
IPPS: 888-893, IEEE Computer Society, 1994.
[Proceedings of the 8th International Symposium on Parallel Processing, Cancún, Mexico, April 1994.]


1993

In-Tournament Digraphs.
Jørgen Bang-Jensen, Jing Huang, Erich Prisner.
J. Comb. Theory, Ser. B 59(2): 267-287, 1993.

Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs.
Jørgen Bang-Jensen, Pavol Hell.
Discrete Applied Mathematics 41(1): 75-79, 1993.

On the Communication Complexity of Zero-Knowledge Proofs.
Joan Boyar, Carsten Lund, René Peralta.
J. Cryptology 6(2): 65-85, 1993.


1992

On the structure of locally semicomplete digraphs.
Jørgen Bang-Jensen.
Discrete Mathematics 100(1-3): 243-265, 1992.

On the complexity of colouring by superdigraphs of bipartite graphs.
Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray.
Discrete Mathematics 109(1-3): 27-44, 1992.

A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs.
Jørgen Bang-Jensen, Yannis Manoussakis, Carsten Thomassen.
J. Algorithms 13(1): 114-127, 1992.

A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs.
Jørgen Bang-Jensen, Carsten Thomassen.
SIAM J. Discrete Math. 5(3): 366-376, 1992.

Unsolved problems presented at the Julius Petersen Graph Theory Conference.
Jørgen Bang-Jensen, Bjarne Toft.
Discrete Mathematics 101(1-3): 351-360, 1992.

An Arithmetic Model of Computation Equivalent to Threshold Circuits.
Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant.
Theor. Comput. Sci. 93(2): 303-319, 1992.

Julius Petersen annotated bibliography.
Margit Christiansen, Jesper Lützen, Gert Sabidussi, Bjarne Toft.
Discrete Mathematics 100(1-3): 83-97, 1992.

A New Formalism for Relational Algebra.
Kim S. Larsen, Michael I. Schwartzbach, Erik Meineche Schmidt.
Inf. Process. Lett. 41(3): 163-168, 1992.

Julius Petersen 1839-1910 a biography.
Jesper Lützen, Gert Sabidussi, Bjarne Toft.
Discrete Mathematics 100(1-3): 9-82, 1992.

Efficient Rebalancing of Chromatic Search Trees.
Joan Boyar, Kim S. Larsen.
SWAT, Lecture Notes in Computer Science 621: 151-164, Springer, 1992.
[Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings.]


1991

Edge-disjoint in- and out-branchings in tournaments and related path problems.
Jørgen Bang-Jensen.
J. Comb. Theory, Ser. B 51(1): 1-23, 1991.

Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.
Joan Boyar, Katalin Friedl, Carsten Lund.
J. Cryptology 4(3): 185-206, 1991.

Eulerian trails through a set of terminals in specific, unique and all orders.
Jørgen Bang-Jensen, Svatopluk Poljak.
Graph Structure Theory, Contemporary Mathematics 147: 247-258, American Mathematical Society, 1991.
[Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle, USA.]

Subquadratic Zero-Knowledge
Joan Boyar, Gilles Brassard, René Peralta.
FOCS: 69-78, IEEE Computer Society, 1991.
[32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991.]


1990

Locally semicomplete digraphs: A generalization of tournaments.
Jørgen Bang-Jensen.
Journal of Graph Theory 14(3): 371-390, 1990.

The effect of two cycles on the complexity of colourings by directed graphs.
Jørgen Bang-Jensen, Pavol Hell.
Discrete Applied Mathematics 26(1): 1-23, 1990.

A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs.
Joan Boyar, S. A. Kurtz, Mark W. Krentel.
J. Cryptology 2(2): 63-76, 1990.

Convertible Undeniable Signatures.
Joan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen.
CRYPTO, Lecture Notes in Computer Science 537: 189-205, Springer, 1990.
[Advances in Cryptology - CRYPTO '90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings.]

Local Tournaments and Proper Circular Arc Gaphs.
Pavol Hell, Jørgen Bang-Jensen, Jing Huang.
SIGAL International Symposium on Algorithms, Lecture Notes in Computer Science 450: 101-108, Springer, 1990.
[Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings.]


1989

Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits.
Joan Boyar.
J. Cryptology 1(3): 177-184, 1989.

Inferring sequences produced by pseudo-random number generators.
Joan Boyar.
J. ACM 36(1): 129-141, 1989.

Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.
Joan Boyar, Katalin Friedl, Carsten Lund.
EUROCRYPT, Lecture Notes in Computer Science 434: 155-172, Springer, 1989.
[Advances in Cryptology - EUROCRYPT '89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings.]

On the Concrete Complexity of Zero-Knowledge Proofs.
Joan Boyar, René Peralta.
CRYPTO, Lecture Notes in Computer Science 435: 507-525, Springer, 1989.
[Advances in Cryptology - CRYPTO '89, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 1989, Proceedings.]


1988

The Complexity of Colouring by Semicomplete Digraphs.
Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray.
SIAM J. Discrete Math. 1(3): 281-298, 1988.

Fully abstract models for a process language with refinement.
Mogens Nielsen, Uffe Engberg, Kim S. Larsen.
REX Workshop, Lecture Notes in Computer Science 354: 523-548, Springer, 1988.
[Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30 - June 3, 1988, Proceedings.]


1987

Coloring Planar Graphs in Parallel.
Joan Boyar, Howard J. Karloff.
J. Algorithms 8(4): 470-479, 1987.

Edge-colored saturated graphs.
Denis Hanson, Bjarne Toft.
Journal of Graph Theory 11(2): 191-196, 1987.

Cyclic coloration of 3-polytopes.
Michael D. Plummer, Bjarne Toft.
Journal of Graph Theory 11(4): 507-515, 1987.


1982

Inferring a Sequence Generated by a Linear Congruence
Joan B. Plumstead.
FOCS: 153-159, IEEE Computer Society, 1982.
[23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982.]


1980

The enumeration problem for color critical linear hypergraphs.
H. L. Abbott, A. Liu, Bjarne Toft.
J. Comb. Theory, Ser. B 29(1): 106-115, 1980.


1974

On critical subgraphs of colour-critical graphs.
Bjarne Toft.
Discrete Mathematics 7(3-4): 377-392, 1974.