Algorithms group at IMADA, SDU

☰

Publications

We list publications by core, current members of the group, independent of the exact area for the work. We do not list publications authored by affiliated members, postdocs, or Ph.D. students. 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 (2024-09-25) for providing data for the publication list.

2024
Stochastic Probing with Increasing Precision.: Martin Hoefer, Kevin Schewior, Daniel Schmand.
SIAM J. Discret. Math. 38(1): 148-169, 2024.
On Seymour's and Sullivan's second neighbourhood conjectures.: Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Shujing Wang, Anders Yeo, Yacong Zhou.
J. Graph Theory 105(3): 413-426, 2024.
Safe sets and in-dominating sets in digraphs.: Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita, Hirotaka Ono, Anders Yeo.
Discret. Appl. Math. 346: 215-227, 2024.
Constrained flows in networks.: Jørgen Bang-Jensen, Stéphane Bessy, Lucas Picasarri-Arrieta.
Theor. Comput. Sci. 1010: 114702, 2024.
Arc-disjoint out- and in-branchings in compositions of digraphs.: Jørgen Bang-Jensen, Y. Wang.
Eur. J. Comb. 120: 103981, 2024.
Online Unit Profit Knapsack with Predictions.: Joan Boyar, Lene M. Favrholdt, Kim S. Larsen.
Algorithmica 86(9): 2786-2821, 2024.
Advice complexity of adaptive priority algorithms.: Joan Boyar, Kim S. Larsen, Denis Pankratov.
Theor. Comput. Sci. 984: 114318, 2024.
Toward the Reconciliation of Inconsistent Molecular Structures from Biochemical Databases.: Casper Asbjørn Eriksen, Jakob Lykke Andersen, Rolf Fagerberg, Daniel Merkle.
J. Comput. Biol. 31(6): 498-512, 2024.
Note on disjoint cycles in multipartite tournaments.: Gregory Z. Gutin, Wei Li, Shujing Wang, Anders Yeo, Yacong Zhou.
Discret. Math. 347(10): 114126, 2024.
Transversals in regular uniform hypergraphs.: Michael A. Henning, Anders Yeo.
J. Graph Theory 105(3): 468-485, 2024.
Reaction rebalancing: a novel approach to curating reaction databases.: Tieu-Long Phan, Klaus Weinbauer, Thomas Gärtner, Daniel Merkle, Jakob L. Andersen, Rolf Fagerberg, Peter F. Stadler.
J. Cheminformatics 16(1): 82, 2024.
Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios.: Benedikt M. Plank, Kevin Schewior.
SIAM J. Discret. Math. 38(3): 2069-2088, 2024.
Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm.: Alexander Armbruster, Lars Rohwedder, Andreas Wiese.
SOSA: 63-81, SIAM, 2024.
[2024 Symposium on Simplicity in Algorithms, SOSA 2024, Alexandria, VA, USA, January 8-10, 2024.]
Santa Claus meets Makespan and Matroids: Algorithms and Reductions.: Étienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder, Jens Schlöter.
SODA: 2829-2860, SIAM, 2024.
[Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024.]
On the Online Weighted Non-Crossing Matching Problem.: Joan Boyar, Shahin Kamali, Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov.
SWAT, LIPIcs 294: 16:1-16:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[19th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2024, June 12-14, 2024, Helsinki, Finland.]
Quickly Determining Who Won an Election.: Lisa Hellerstein, Naifeng Liu, Kevin Schewior.
ITCS, LIPIcs 287: 61:1-61:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA.]
2023
Online bin covering with limited migration.: Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder.
J. Comput. Syst. Sci. 134: 42-72, 2023.
Results on the small quasi-kernel conjecture.: Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou.
Discret. Math. 346(7): 113435, 2023.
k-best feature selection and ranking via stochastic approximation.: David V. Akman, Milad Malekipirbazari, Zeren D. Yenice, Anders Yeo, Niranjan Adhikari, Yong Kai Wong, Babak Abbasi, Alev Taskin Gumus.
Expert Syst. Appl. 213(Part): 118864, 2023.
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations.: Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell.
Theor. Comput. Sci. 973: 114097, 2023.
Spanning eulerian subdigraphs in semicomplete digraphs.: Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo.
J. Graph Theory 102(3): 578-606, 2023.
Making a tournament k $k$-strong.: Jørgen Bang-Jensen, Kasper Skov Johansen, Anders Yeo.
J. Graph Theory 103(1): 5-11, 2023.
The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties.: Jørgen Bang-Jensen, Anders Yeo.
Theor. Comput. Sci. 949: 113758, 2023.
Improved Bounds for Open Online Dial-a-Ride on the Line.: Alexander Birx, Yann Disser, Kevin Schewior.
Algorithmica 85(5): 1372-1414, 2023.
Speed-robust scheduling: sand, bricks, and rocks.: Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon.
Math. Program. 197(2): 1009-1048, 2023.
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden.: Franziska Eberle, Nicole Megow, Kevin Schewior.
ACM Trans. Algorithms 19(1): 10:1-10:25, 2023.
Preference swaps for the stable matching problem.: Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo.
Theor. Comput. Sci. 940(Part): 222-230, 2023.
Online cardinality constrained scheduling.: Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder.
Oper. Res. Lett. 51(5): 533-539, 2023.
Exact capacitated domination: On the computational complexity of uniqueness.: Gregory Z. Gutin, Philip R. Neary, Anders Yeo.
Discret. Appl. Math. 332: 155-169, 2023.
Unique stable matchings.: Gregory Z. Gutin, Philip R. Neary, Anders Yeo.
Games Econ. Behav. 141: 529-547, 2023.
(1,1)-Cluster Editing is polynomial-time solvable.: Gregory Z. Gutin, Anders Yeo.
Discret. Appl. Math. 340: 259-271, 2023.
Lower Bounds for Maximum Weighted Cut.: Gregory Z. Gutin, Anders Yeo.
SIAM J. Discret. Math. 37(2): 1142-1161, 2023.
The Tuza-Vestergaard Theorem.: Michael A. Henning, Christian Löwenstein, Anders Yeo.
SIAM J. Discret. Math. 37(2): 1275-1310, 2023.
On Integer Programming, Discrepancy, and Convolution.: Klaus Jansen, Lars Rohwedder.
Math. Oper. Res. 48(3): 1481-1495, 2023.
Directed Steiner tree packing and directed tree connectivity.: Yuefang Sun, Anders Yeo.
J. Graph Theory 102(1): 86-106, 2023.
Paging with Succinct Predictions.: Antonios Antoniadis, Joan Boyar, Marek Eliás, Lene Monrad Favrholdt, Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon.
ICML, Proceedings of Machine Learning Research 202: 952-968, PMLR, 2023.
[International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA..]
Trading Prophets.: José Correa, Andrés Cristi, Paul Duetting, MohammadTaghi Hajiaghayi, Jan Olkowski, Kevin Schewior.
EC: 490-510, ACM, 2023.
[Proceedings of the 24th ACM Conference on Economics and Computation, EC 2023, London, United Kingdom, July 9-12, 2023.]
Threshold Testing and Semi-Online Prophet Inequalities.: Martin Hoefer, Kevin Schewior.
ESA, LIPIcs 274: 62:1-62:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands.]
On the Realisability of Chemical Pathways.: Jakob L. Andersen, Sissel Banke, Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Peter F. Stadler.
ISBRA, Lecture Notes in Computer Science 14248: 409-419, Springer, 2023.
[Bioinformatics Research and Applications - 19th International Symposium, ISBRA 2023, Wrocław, Poland, October 9-12, 2023, Proceedings.]
A PTAS for Minimizing Weighted Flow Time on a Single Machine.: Alexander Armbruster, Lars Rohwedder, Andreas Wiese.
STOC: 1335-1344, ACM, 2023.
[Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023.]
Better Trees for Santa Claus.: Étienne Bamas, Lars Rohwedder.
STOC: 1862-1875, ACM, 2023.
[Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023.]
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands.: Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh.
ESA, LIPIcs 274: 13:1-13:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands.]
Online Minimum Spanning Trees with Weight Predictions.: Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen.
WADS, Lecture Notes in Computer Science 14079: 136-148, Springer, 2023.
[Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings.]
Online Algorithms with Predictions (Invited Talk).: Joan Boyar.
MFCS, LIPIcs 272: 2:1-2:2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France.]
Quotable Signatures for Authenticating Shared Quotes.: Joan Boyar, Simon Erfurth, Kim S. Larsen, Ruben Niederhagen.
LATINCRYPT, Lecture Notes in Computer Science 14168: 273-292, Springer, 2023.
[Progress in Cryptology - LATINCRYPT 2023 - 8th International Conference on Cryptology and Information Security in Latin America, LATINCRYPT 2023, Quito, Ecuador, October 3-6, 2023, Proceedings.]
Online Interval Scheduling with Predictions.: Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen.
WADS, Lecture Notes in Computer Science 14079: 193-207, Springer, 2023.
[Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings.]
Optimizing Low Dimensional Functions over the Integers.: Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae.
IPCO, Lecture Notes in Computer Science 13904: 115-126, Springer, 2023.
[Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings.]
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems.: Argyrios Deligkas, Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Anders Yeo.
IJCAI: 2642-2650, ijcai.org, 2023.
[Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China.]
Incremental Maximization via Continuization.: Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker.
ICALP, LIPIcs 261: 47:1-47:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany.]
Reconciling Inconsistent Molecular Structures from Biochemical Databases.: Casper Asbjørn Eriksen, Jakob Lykke Andersen, Rolf Fagerberg, Daniel Merkle.
ISBRA, Lecture Notes in Computer Science 14248: 58-71, Springer, 2023.
[Bioinformatics Research and Applications - 19th International Symposium, ISBRA 2023, Wrocław, Poland, October 9-12, 2023, Proceedings.]
Improved Approximation Algorithms for the Expanding Search Problem.: Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior.
ESA, LIPIcs 274: 54:1-54:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands.]
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs.: Kim-Manuel Klein, Adam Polak, Lars Rohwedder.
SODA: 2947-2960, SIAM, 2023.
[Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023.]
2022
Online search for a hyperplane in high-dimensional Euclidean space.: Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak, Kevin Schewior.
Inf. Process. Lett. 177: 106262, 2022.
Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution.: José Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior.
Math. Oper. Res. 47(2): 1287-1309, 2022.
Representing Catalytic Mechanisms with Rule Composition.: Jakob L. Andersen, Rolf Fagerberg, Christoph Flamm, Walter Fontana, Juraj Kolcák, Christophe V. F. P. Laurent, Daniel Merkle, Nikolai Nøjgaard.
J. Chem. Inf. Model. 62(22): 5513-5524, 2022.
Complexity of some arc-partition problems for digraphs.: Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves, Lucas Picasarri-Arrieta.
Theor. Comput. Sci. 928: 167-182, 2022.
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2.: Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo.
J. Graph Theory 100(2): 294-314, 2022.
Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2.: Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo.
Graphs Comb. 38(6): 187, 2022.
Component Order Connectivity in Directed Graphs.: Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo.
Algorithmica 84(9): 2767-2784, 2022.
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties.: Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo.
J. Graph Theory 99(4): 615-636, 2022.
Every (13k - 6)-strong tournament with minimum out-degree at least 28k - 13 is k-linked.: Jørgen Bang-Jensen, Kasper Skov Johansen.
Discret. Math. 345(6): 112831, 2022.
Good acyclic orientations of 4-regular 4-connected graphs.: Jørgen Bang-Jensen, Matthias Kriesell.
J. Graph Theory 100(4): 698-720, 2022.
Digraphs and Variable Degeneracy.: Jørgen Bang-Jensen, Thomas Schweser, Michael Stiebitz.
SIAM J. Discret. Math. 36(1): 578-595, 2022.
Fragile complexity of adaptive algorithms.: Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman.
Theor. Comput. Sci. 919: 92-102, 2022.
Relaxing the Irrevocability Requirement for Online Graph Algorithms.: Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen.
Algorithmica 84(7): 1916-1951, 2022.
Relative Worst-order Analysis: A Survey.: Joan Boyar, Lene M. Favrholdt, Kim S. Larsen.
ACM Comput. Surv. 54(1): 8:1-8:21, 2022.
Generic Context-Aware Group Contributions.: Christoph Flamm, Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard, Peter F. Stadler.
IEEE ACM Trans. Comput. Biol. Bioinform. 19(1): 429-442, 2022.
Perfect forests in graphs and their extensions.: Gregory Z. Gutin, Anders Yeo.
J. Graph Theory 101(3): 572-592, 2022.
A complete description of convex sets associated with matchings and edge-connectivity in graphs.: Michael A. Henning, Anders Yeo.
J. Graph Theory 101(4): 643-667, 2022.
Flow time scheduling and prefix Beck-Fiala.: Nikhil Bansal, Lars Rohwedder, Ola Svensson.
STOC: 331-342, ACM, 2022.
[STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022.]
Load Balancing: The Long Road from Theory to Practice.: Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder.
ALENEX: 104-116, SIAM, 2022.
[Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022.]
Towards Non-Uniform k-Center with Constant Types of Radii.: Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson.
SOSA: 228-237, SIAM, 2022.
[5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, January 10-11, 2022.]
Knapsack Secretary Through Boosting.: Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer.
WAOA, Lecture Notes in Computer Science 13538: 61-81, Springer, 2022.
[Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings.]
Online Unit Profit Knapsack with Untrusted Predictions.: Joan Boyar, Lene M. Favrholdt, Kim S. Larsen.
SWAT, LIPIcs 227: 20:1-20:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, June 27-29, 2022, Tórshavn, Faroe Islands..]
Cardinality Constrained Scheduling in Online Models.: Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder.
STACS, LIPIcs 219: 28:1-28:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)..]
Completeness and Diversity in Depth-First Proof-Number Search with Applications to Retrosynthesis.: Christopher Franz, Georg Mogk, Thomas Mrziglod, Kevin Schewior.
IJCAI: 4747-4753, ijcai.org, 2022.
[Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022..]
2021
Graph transformation for enzymatic mechanisms.: Jakob L. Andersen, Rolf Fagerberg, Christoph Flamm, Walter Fontana, Juraj Kolcák, Christophe V. F. P. Laurent, Daniel Merkle, Nikolai Nøjgaard.
Bioinform. 37(Supplement): 392-400, 2021.
Online Multistage Subset Maximization Problems.: Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller.
Algorithmica 83(8): 2374-2399, 2021.
Proper-walk connection number of graphs.: Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo.
J. Graph Theory 96(1): 137-159, 2021.
On Supereulerian 2-Edge-Coloured Graphs.: Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo.
Graphs Comb. 37(6): 2601-2620, 2021.
Good orientations of unions of edge-disjoint spanning trees.: Jørgen Bang-Jensen, Stéphane Bessy, Jing Huang, Matthias Kriesell.
J. Graph Theory 96(4): 594-618, 2021.
On the inversion number of oriented graphs.: Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet.
Discret. Math. Theor. Comput. Sci. 23(2), 2021.
Rewriting theory for the life sciences: A unifying theory of CTMC semantics.: Nicolas Behr, Jean Krivine, Jakob L. Andersen, Daniel Merkle.
Theor. Comput. Sci. 884: 68-115, 2021.
Tight Bounds for Online TSP on the Line.: Antje Bjelde, Jan Hackfeld, Yann Disser, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Miriam Schlöter, Kevin Schewior, Leen Stougie.
ACM Trans. Algorithms 17(1): 3:1-3:58, 2021.
Approximation Results for Makespan Minimization with Budgeted Uncertainty.: Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder.
Theory Comput. Syst. 65(6): 903-915, 2021.
Online Bin Covering with Advice.: Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen.
Algorithmica 83(3): 795-821, 2021.
A stronger impossibility for fully online matching.: Alexander Eckl, Anja Kirschbaum, Marilena Leichter, Kevin Schewior.
Oper. Res. Lett. 49(5): 802-808, 2021.
A new upper bound on the total domination number in graphs with minimum degree six.: Michael A. Henning, Anders Yeo.
Discret. Appl. Math. 302: 1-7, 2021.
Lower bounds on Tuza constants for transversals in linear uniform hypergraphs.: Michael A. Henning, Anders Yeo.
Discret. Appl. Math. 304: 12-22, 2021.
Matching and edge-connectivity in graphs with given maximum degree.: Michael A. Henning, Anders Yeo.
Discret. Math. 344(8): 112438, 2021.
Affine Planes and Transversals in 3-Uniform Linear Hypergraphs.: Michael A. Henning, Anders Yeo.
Graphs Comb. 37(3): 867-890, 2021.
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths.: Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Kevin Schewior, Jens Vygen.
SIAM J. Discret. Math. 35(2): 752-769, 2021.
Dominating vertex covers: the vertex-edge domination problem.: William F. Klostermeyer, Margaret-Ellen Messinger, Anders Yeo.
Discuss. Math. Graph Theory 41(1): 123-132, 2021.
Cut-Edges and Regular Factors in Regular Graphs of Odd Degree.: Alexandr V. Kostochka, André Raspaud, Bjarne Toft, Douglas B. West, Dara Zirlin.
Graphs Comb. 37(1): 199-207, 2021.
Cayley Graphs of Semigroups Applied to Atom Tracking in Chemistry.: Nikolai Nøjgaard, Walter Fontana, Marc Hellmuth, Daniel Merkle.
J. Comput. Biol. 28(7): 701-715, 2021.
Knapsack and Subset Sum with Small Items.: Adam Polak, Lars Rohwedder, Karol Wegrzycki.
ICALP, LIPIcs 198: 106:1-106:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)..]
Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility (Extended Abstract).: José Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior, Bruno Ziliotto.
ITCS, LIPIcs 185: 86:1-86:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8, 2021, Virtual Conference..]
Stochastic Probing with Increasing Precision.: Martin Hoefer, Kevin Schewior, Daniel Schmand.
IJCAI: 4069-4075, ijcai.org, 2021.
[Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021..]
The Submodular Santa Claus Problem in the Restricted Assignment Case.: Étienne Bamas, Paritosh Garg, Lars Rohwedder.
ICALP, LIPIcs 198: 22:1-22:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)..]
k-Distinct Branchings Admits a Polynomial Kernel.: Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh.
ESA, LIPIcs 204: 11:1-11:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference)..]
Fragile Complexity of Adaptive Algorithms.: Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman.
CIAC, Lecture Notes in Computer Science 12701: 144-157, Springer, 2021.
[Algorithms and Complexity - 12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings.]
An Experimental Study of External Memory Algorithms for Connected Components.: Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran.
SEA, LIPIcs 190: 23:1-23:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[19th International Symposium on Experimental Algorithms, SEA 2021, June 7-9, 2021, Nice, France..]
Additive Approximation Schemes for Load Balancing Problems.: Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese.
ICALP, LIPIcs 198: 42:1-42:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)..]
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time.: Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder, Robert Weismantel.
SODA: 1666-1681, SIAM, 2021.
[Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021.]
Speed-Robust Scheduling - Sand, Bricks, and Rocks.: Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon.
IPCO, Lecture Notes in Computer Science 12707: 283-296, Springer, 2021.
[Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings.]
Perfect Forests in Graphs and Their Extensions.: Gregory Z. Gutin, Anders Yeo.
MFCS, LIPIcs 202: 54:1-54:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia..]
A (2 + ε)-approximation algorithm for preemptive weighted flow time on a single machine.: Lars Rohwedder, Andreas Wiese.
STOC: 1042-1055, ACM, 2021.
[STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021..]
2020
A PTAS for Euclidean TSP with Hyperplane Neighborhoods.: Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior.
ACM Trans. Algorithms 16(3): 38:1-38:16, 2020.
A general framework for handling commitment in online throughput maximization.: Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Clifford Stein.
Math. Program. 183(1): 215-247, 2020.
Out-colourings of digraphs.: Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy.
J. Graph Theory 93(1): 88-112, 2020.
Defining Autocatalysis in Chemical Reaction Networks.: Jakob L. Andersen, Christoph Flamm, Daniel Merkle, Peter F. Stadler.
Journal of Systems Chemistry 8: 121-133, 2020.
A Generic Framework for Engineering Graph Canonization Algorithms.: Jakob L. Andersen, Daniel Merkle.
ACM J. Exp. Algorithmics 25: 1-26, 2020.
A Generic Framework for Engineering Graph Canonization Algorithms.: Jakob L. Andersen, Daniel Merkle.
J. Exp. Algorithmics 25(1): 1.2, 2020.
Combining Graph Transformations and Semigroups for Isotopic Labeling Design.: Jakob L. Andersen, Daniel Merkle, Peter S. Rasmussen.
J. Comput. Biol. 27(2): 269-287, 2020.
On the parameterized complexity of 2-partitions.: Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo.
Theor. Comput. Sci. 844: 97-105, 2020.
The directed 2-linkage problem with length constraints.: Jørgen Bang-Jensen, Thomas Bellitto, William Lochet, Anders Yeo.
Theor. Comput. Sci. 814: 69-73, 2020.
On DP-coloring of digraphs.: Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz.
J. Graph Theory 95(1): 76-98, 2020.
Hajós and Ore Constructions for Digraphs.: Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser, Michael Stiebitz.
Electron. J. Comb. 27(1): 1, 2020.
Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments.: Jørgen Bang-Jensen, Hugues Déprés, Anders Yeo.
Discret. Math. 343(12): 112129, 2020.
Arc-disjoint strong spanning subdigraphs of semicomplete compositions.: Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo.
J. Graph Theory 95(2): 267-289, 2020.
Advice Complexity of Priority Algorithms.: Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov.
Theory Comput. Syst. 64(4): 593-625, 2020.
Randomized distributed online algorithms against adaptive offline adversaries.: Joan Boyar, Faith Ellen, Kim S. Larsen.
Inf. Process. Lett. 161: 105973, 2020.
Bounds on upper transversals in hypergraphs.: Michael A. Henning, Anders Yeo.
J. Comb. Optim. 39(1): 77-89, 2020.
Near-Linear Time Algorithm for n-Fold ILPs via Color Coding.: Klaus Jansen, Alexandra Lassota, Lars Rohwedder.
SIAM J. Discret. Math. 34(4): 2282-2299, 2020.
A note on the integrality gap of the configuration LP for restricted Santa Claus.: Klaus Jansen, Lars Rohwedder.
Inf. Process. Lett. 164: 106025, 2020.
A Quasi-Polynomial Approximation for the Restricted Assignment Problem.: Klaus Jansen, Lars Rohwedder.
SIAM J. Comput. 49(6): 1083-1108, 2020.
A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework.: Jakob Lykke Andersen, Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard, Marco Peressotti.
SOFSEM (Doctoral Student Research Forum), CEUR Workshop Proceedings 2568: 121-132, CEUR-WS.org, 2020.
[Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), Limassol, Cyprus, January 20-24, 2020..]
Learning Augmented Energy Minimization via Speed Scaling.: Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson.
NeurIPS, 2020.
[Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual..]
Component Order Connectivity in Directed Graphs.: Jørgen Bang-Jensen, Eduard Eiben, Gregory Z. Gutin, Magnus Wahlström, Anders Yeo.
IPEC, LIPIcs 180: 2:1-2:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)..]
Inversion number of an oriented graph and related parameters.: Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet.
ALGOS, CEUR Workshop Proceedings 2925: 101-121, CEUR-WS.org, 2020.
[Proceedings of the First International Conference "Algebras, graphs and ordered sets", ALGOS 2020, Online (originally planned in Nancy, France), August 26-28, 2020..]
Optimally Handling Commitment Issues in Online Throughput Maximization.: Franziska Eberle, Nicole Megow, Kevin Schewior.
ESA, LIPIcs 173: 41:1-41:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)..]
Robust Algorithms Under Adversarial Injections.: Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson.
ICALP, LIPIcs 168: 56:1-56:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)..]
Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games.: Gregory Z. Gutin, Philip R. Neary, Anders Yeo.
COCOON, Lecture Notes in Computer Science 12273: 360-371, Springer, 2020.
[Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings.]
Atom Tracking Using Cayley Graphs.: Marc Hellmuth, Daniel Merkle, Nikolai Nøjgaard.
ISBRA, Lecture Notes in Computer Science 12304: 406-415, Springer, 2020.
[Bioinformatics Research and Applications - 16th International Symposium, ISBRA 2020, Moscow, Russia, December 1-4, 2020, Proceedings.]
Computational Simulations for Cyclizations Catalyzed by Plant Monoterpene Synthases.: Waldeyr Mendes Cordeiro da Silva, Daniela P. de Andrade, Jakob L. Andersen, Maria Emília Telles Walter, Marcelo M. Brigido, Peter F. Stadler, Christoph Flamm.
BSB, Lecture Notes in Computer Science 12558: 247-258, Springer, 2020.
[Advances in Bioinformatics and Computational Biology - 13th Brazilian Symposium on Bioinformatics, BSB 2020, São Paulo, Brazil, November 23-27, 2020, Proceedings.]
2019
Chemical Transformation Motifs - Modelling Pathways as Integer Hyperflows.: Jakob L. Andersen, Christoph Flamm, Daniel Merkle, Peter F. Stadler.
IEEE ACM Trans. Comput. Biol. Bioinform. 16(2): 510-523, 2019.
Degree-constrained 2-partitions of graphs.: Jørgen Bang-Jensen, Stéphane Bessy.
Theor. Comput. Sci. 776: 64-74, 2019.
Bipartite spanning sub(di)graphs induced by 2-partitions.: Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo.
J. Graph Theory 92(2): 130-151, 2019.
The parameterized complexity landscape of finding 2-partitions of digraphs.: Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh, Meirav Zehavi.
Theor. Comput. Sci. 795: 108-114, 2019.
On Plane Constrained Bounded-Degree Spanners.: Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot.
Algorithmica 81(4): 1392-1415, 2019.
Online Dominating Set.: Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen.
Algorithmica 81(5): 1938-1964, 2019.
Tight Bounds for Restricted Grid Scheduling.: Joan Boyar, Faith Ellen.
Int. J. Found. Comput. Sci. 30(3): 375-405, 2019.
Small low-depth circuits for cryptographic applications.: Joan Boyar, Magnus Gausdal Find, René Peralta.
Cryptogr. Commun. 11(1): 109-127, 2019.
Graph Edge Coloring: A Survey.: Yan Cao, Guantao Chen, Guangming Jing, Michael Stiebitz, Bjarne Toft.
Graphs Comb. 35(1): 33-66, 2019.
Handling preferences in student-project allocation.: Marco Chiarandini, Rolf Fagerberg, Stefano Gualandi.
Ann. Oper. Res. 275(1): 39-78, 2019.
Upper transversals in hypergraphs.: Michael A. Henning, Anders Yeo.
Eur. J. Comb. 78: 1-12, 2019.
Strong subgraph k-connectivity.: Yuefang Sun, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang.
J. Graph Theory 92(1): 5-18, 2019.
A PTAS for Euclidean TSP with Hyperplane Neighborhoods.: Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior.
SODA: 1089-1105, SIAM, 2019.
[Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019.]
Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution.: José Correa, Paul Dütting, Felix A. Fischer, Kevin Schewior.
EC: 3-17, ACM, 2019.
[Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, Phoenix, AZ, USA, June 24-28, 2019..]
Online Bin Covering with Limited Migration.: Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder.
ESA, LIPIcs 144: 18:1-18:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany..]
A General Framework for Handling Commitment in Online Throughput Maximization.: Lin Chen, Franziska Eberle, Nicole Megow, Kevin Schewior, Cliff Stein.
IPCO, Lecture Notes in Computer Science 11480: 141-154, Springer, 2019.
[Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings.]
Fragile Complexity of Comparison-Based Algorithms.: Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava.
ESA, LIPIcs 144: 2:1-2:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany..]
Graph Transformations, Semigroups, and Isotopic Labeling.: Jakob L. Andersen, Daniel Merkle, Peter S. Rasmussen.
ISBRA, Lecture Notes in Computer Science 11490: 196-207, Springer, 2019.
[Bioinformatics Research and Applications - 15th International Symposium, ISBRA 2019, Barcelona, Spain, June 3-6, 2019, Proceedings.]
Online Multistage Subset Maximization Problems.: Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller.
ESA, LIPIcs 144: 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany..]
Improved Bounds for Open Online Dial-a-Ride on the Line.: Alexander Birx, Yann Disser, Kevin Schewior.
APPROX-RANDOM, LIPIcs 145: 21:1-21:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA..]
Approximation Results for Makespan Minimization with Budgeted Uncertainty.: Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder.
WAOA, Lecture Notes in Computer Science 11926: 60-71, Springer, 2019.
[Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers.]
Online Bin Covering with Advice.: Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen.
WADS, Lecture Notes in Computer Science 11646: 225-238, Springer, 2019.
[Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings.]
On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?: Rolf Fagerberg, David Hammer, Ulrich Meyer.
ISAAC, LIPIcs 149: 35:1-35:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China..]
Near-Linear Time Algorithm for n-fold ILPs via Color Coding.: Klaus Jansen, Alexandra Lassota, Lars Rohwedder.
ICALP, LIPIcs 132: 75:1-75:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece..]
On Integer Programming and Convolution.: Klaus Jansen, Lars Rohwedder.
ITCS, LIPIcs 124: 43:1-43:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[10th Innovations in Theoretical Computer Science Conference, ITCS 2019, January 10-12, 2019, San Diego, California, USA.]
Local Search Breaks 1.75 for Graph Balancing.: Klaus Jansen, Lars Rohwedder.
ICALP, LIPIcs 132: 74:1-74:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece..]
Algorithms for Integer Programming and Allocation.: Lars Rohwedder.
University of Kiel, Germany, 2019.
2018
An O(log m)-Competitive Algorithm for Online Machine Minimization.: Lin Chen, Nicole Megow, Kevin Schewior.
SIAM J. Comput. 47(6): 2057-2077, 2018.
χ-bounded families of oriented graphs.: Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora.
J. Graph Theory 89(3): 304-326, 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.
J. 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. Sched. 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.
Discret. Appl. Math. 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 Informatica 55(1): 57-80, 2018.
DNA-templated synthesis optimization.: Bjarke N. Hansen, Kim S. Larsen, Daniel Merkle, Alexei Mihalchuk.
Nat. Comput. 17(4): 693-707, 2018.
Tight lower bounds on the matching number in a graph with given maximum degree.: Michael A. Henning, Anders Yeo.
J. Graph Theory 89(2): 115-149, 2018.
Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs.: Michael A. Henning, Anders Yeo.
Discret. Math. 341(8): 2285-2292, 2018.
On Upper Transversals in 3-Uniform Hypergraphs.: Michael A. Henning, Anders Yeo.
Electron. J. Comb. 25(4): 4, 2018.
Time-consistent reconciliation maps and forbidden time travel.: Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth.
Algorithms Mol. Biol. 13(1): 2:1-2:17, 2018.
A Brooks Type Theorem for the Maximum Local Edge Connectivity.: Michael Stiebitz, Bjarne Toft.
Electron. J. Comb. 25(1): 1, 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.]
SUPERSET: A (Super)Natural Variant of the Card Game SET.: Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, Andreas Tönnis.
FUN, LIPIcs 100: 12:1-12:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[9th International Conference on Fun with Algorithms, FUN 2018, June 13-15, 2018, La Maddalena, Italy.]
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..]
Compact LP Relaxations for Allocation Problems.: Klaus Jansen, Lars Rohwedder.
SOSA, OASIcs 61: 11:1-11:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA.]
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.]
The Itinerant List Update Problem.: Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie.
WAOA, Lecture Notes in Computer Science 11312: 310-326, Springer, 2018.
[Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers.]
Locally Semicomplete Digraphs and Generalizations.: Jørgen Bang-Jensen.
Classes of Directed Graphs: 245-296, 2018.
Basic Terminology, Notation and Results.: Jørgen Bang-Jensen, Gregory Z. Gutin.
Classes of Directed Graphs: 1-34, 2018.
Tournaments and Semicomplete Digraphs.: Jørgen Bang-Jensen, Frédéric Havet.
Classes of Directed Graphs: 35-124, 2018.
Semicomplete Multipartite Digraphs.: Anders Yeo.
Classes of Directed Graphs: 297-340, 2018.
2017
Antistrong digraphs.: Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell.
J. Comb. Theory B 122: 68-90, 2017.
Disjoint Paths in Decomposable Digraphs.: Jørgen Bang-Jensen, Tilde My Christiansen, Alessandro Maddaloni.
J. Graph Theory 85(2): 545-567, 2017.
Competitive local routing with constraints.: Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot.
J. Comput. Geom. 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.
Discret. Math. 340(11): 2678-2687, 2017.
Formally Proving Size Optimality of Sorting Networks.: Luís Cruz-Filipe, Kim S. Larsen, Peter Schneider-Kamp.
J. Autom. Reason. 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.
Autom. 86: 166-173, 2017.
Chinese Postman Problem on edge-colored multigraphs.: Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo.
Discret. Appl. Math. 217: 196-202, 2017.
Acyclicity in edge-colored graphs.: Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström, Anders Yeo.
Discret. Math. 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.
J. Graph Theory 85(2): 372-377, 2017.
A note on fractional disjoint transversals in hypergraphs.: Michael A. Henning, Anders Yeo.
Discret. Math. 340(10): 2349-2354, 2017.
Transversals and Independence in Linear Hypergraphs with Maximum Degree Two.: Michael A. Henning, Anders Yeo.
Electron. J. Comb. 24(2): 2, 2017.
A Tight Lower Bound for Online Convex Optimization with Switching Costs.: Antonios Antoniadis, Kevin Schewior.
WAOA, Lecture Notes in Computer Science 10787: 164-175, Springer, 2017.
[Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers.]
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.]
Tight Bounds for Online TSP on the Line.: Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, Leen Stougie.
SODA: 994-1005, SIAM, 2017.
[Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19.]
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.]
On the Configuration-LP of the Restricted Assignment Problem.: Klaus Jansen, Lars Rohwedder.
SODA: 2670-2678, SIAM, 2017.
[Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19.]
A Quasi-Polynomial Approximation for the Restricted Assignment Problem.: Klaus Jansen, Lars Rohwedder.
IPCO, Lecture Notes in Computer Science 10328: 305-316, Springer, 2017.
[Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings.]
Structured Instances of Restricted Assignment with Two Processing Times.: Klaus Jansen, Lars Rohwedder.
CALDAM, Lecture Notes in Computer Science 10156: 230-241, Springer, 2017.
[Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 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 für 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 für Informatik, 2017.
[17th International Workshop on Algorithms in Bioinformatics, WABI 2017, August 21-23, 2017, Boston, MA, USA.]
Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing.: Kevin Schewior.
OR, Operations Research Proceedings: 25-29, Springer, 2017.
[Operations Research Proceedings 2017, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Freie Universiät Berlin, Germany, September 6-8, 2017..]
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.
Discret. Appl. Math. 209: 16-26, 2016.
Arc-Disjoint Directed and Undirected Cycles in Digraphs.: Jørgen Bang-Jensen, Matthias Kriesell, Alessandro Maddaloni, Sven Simonsen.
J. Graph Theory 83(4): 406-420, 2016.
DAG-Width and Circumference of Digraphs.: Jørgen Bang-Jensen, Tilde My Larsen.
J. 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.
Cryptogr. Commun. 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.
Discret. Math. 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.
Discret. Math. 339(2): 1004-1027, 2016.
Routing Games With Progressive Filling.: Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik.
IEEE/ACM Trans. Netw. 24(4): 2553-2562, 2016.
Transversals in 4-Uniform Hypergraphs.: Michael A. Henning, Anders Yeo.
Electron. J. Comb. 23(3): 3, 2016.
Chasing Convex Bodies and Functions.: Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, Michele Scquizzato.
LATIN, Lecture Notes in Computer Science 9644: 68-81, Springer, 2016.
[LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings.]
An O(log m)-Competitive Algorithm for Online Machine Minimization.: Lin Chen, Nicole Megow, Kevin Schewior.
SODA: 155-163, SIAM, 2016.
[Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016.]
The Power of Migration in Online Machine Minimization.: Lin Chen, Nicole Megow, Kevin Schewior.
SPAA: 175-184, ACM, 2016.
[Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 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 für Informatik, 2016.
[15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland.]
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.]
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.]
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.
Analysis of Generative Chemistries: Jakob Lykke Andersen.
Leipzig University, Germany, 2016.
base-search.net (ftunivleipzig:oai:qucosa:de:qucosa:14700)
Handling critical tasks online: deadline scheduling and convex-body chasing.: Kevin Schewior.
Technical University of Berlin, Germany, 2016.
2015
Towards Optimal DNA-Templated Computing.: Jakob L. Andersen, Christoph Flamm, Martin M. Hanczyc, Daniel Merkle.
Int. J. Unconv. Comput. 11(3-4): 185-203, 2015.
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles.: Jørgen Bang-Jensen, Stéphane Bessy.
J. Graph Theory 79(4): 249-266, 2015.
Restricted cycle factors and arc-decompositions of digraphs.: Jørgen Bang-Jensen, Carl Johan Casselgren.
Discret. Appl. Math. 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.
J. 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.
J. Comput. Geom. 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.
J. 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.
J. Graph Theory 80(2): 112-135, 2015.
Total Transversals in Hypergraphs and Their Applications.: Michael A. Henning, Anders Yeo.
SIAM J. Discret. Math. 29(1): 309-320, 2015.
Task allocation in organic computing systems: networks with reconfigurable helper units.: Daniel Merkle, Martin Middendorf, Alexander Scheidler.
Int. J. Auton. Adapt. Commun. Syst. 8(1): 60-80, 2015.
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs.: Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein.
APPROX-RANDOM, LIPIcs 40: 96-109, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015.
[Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA.]
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 für 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.
Discret. Math. Theor. Comput. Sci. 16(1): 293-302, 2014.
Generic strategies for chemical space exploration.: Jakob L. Andersen, Christoph Flamm, Daniel Merkle, Peter F. Stadler.
Int. J. Comput. Biol. Drug Des. 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.
J. 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é.
J. 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 B 106: 1-14, 2014.
Arc-Disjoint Paths in Decomposable Digraphs.: Jørgen Bang-Jensen, Alessandro Maddaloni.
J. 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.
Electron. J. Comb. 21(2): 2, 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.
J. 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.
Discret. Math. 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.
Electron. J. Comb. 21(1): 1, 2014.
A new lower bound for the total domination number in graphs proving a Graffiti.pc Conjecture.: Michael A. Henning, Anders Yeo.
Discret. Appl. Math. 173: 45-52, 2014.
Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs.: Michael A. Henning, Anders Yeo.
Graphs Comb. 30(4): 909-932, 2014.
A winning strategy for 3×n Cylindrical Hex.: Samuel Clowes Huneke, Ryan B. Hayward, Bjarne Toft.
Discret. Math. 331: 93-97, 2014.
Towards an Optimal DNA-Templated Molecular Assembler.: Jakob L. Andersen, Christoph Flamm, Martin M. Hanczyc, Daniel Merkle.
ALIFE: 557-564, MIT Press, 2014.
[Fourteenth International Conference on the Simulation and Synthesis of Living Systems, ALIFE 2014, New York, NY, USA, July 30 - August 2, 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.
SoCG: 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 für 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.]
Routing games with progressive filling.: Tobias Harks, Martin Hoefer, Kevin Schewior, Alexander Skopalik.
INFOCOM: 352-360, IEEE, 2014.
[2014 IEEE Conference on Computer Communications, INFOCOM 2014, Toronto, Canada, April 27 - May 2, 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.
Discret. Appl. Math. 161(7-8): 889-898, 2013.
Arc-disjoint paths and trees in 2-regular digraphs.: Jørgen Bang-Jensen, Sven Simonsen.
Discret. Appl. Math. 161(16-17): 2724-2730, 2013.
Four Measures of Nonlinearity.: Joan Boyar, Magnus Find, René Peralta.
IACR Cryptol. ePrint Arch. 2013: 633, 2013.
Logic Minimization Techniques with Applications to Cryptology.: Joan Boyar, Philip Matthews, René Peralta.
J. Cryptol. 26(2): 280-312, 2013.
Online multi-coloring on the path revisited.: Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen.
Acta Informatica 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, 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.
Better bounds on online unit clustering.: Martin R. Ehmsen, Kim S. Larsen.
Theor. Comput. Sci. 500: 1-24, 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.
On the Complexity of Reconstructing Chemical Reaction Networks.: Rolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters, Peter F. Stadler.
Math. Comput. Sci. 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.
J. 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.
Discret. Math. 313(2): 174-181, 2013.
Hypergraphs with large transversal number.: Michael A. Henning, Anders Yeo.
Discret. Math. 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 Bioinform. 14(S-2): S18, 2013.
Swarm controlled emergence for ant clustering.: Alexander Scheidler, Daniel Merkle, Martin Middendorf.
Int. J. Intell. Comput. Cybern. 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.]
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.]
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.]
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
Efficient algorithms for real-life instances of the variable size bin packing problem.: Jørgen Bang-Jensen, Rune Larsen.
Comput. Oper. Res. 39(11): 2848-2857, 2012.
Decomposing locally semicomplete digraphs into strong spanning subdigraphs.: Jørgen Bang-Jensen, Jing Huang.
J. Comb. Theory 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.
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.
Discret. Appl. Math. 160(13-14): 1914-1923, 2012.
A new variable-sized bin packing problem.: Joan Boyar, Lene M. Favrholdt.
J. Sched. 15(3): 273-287, 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.
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.
Comparing online algorithms for bin packing problems.: Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt.
J. Sched. 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.
Discret. Appl. Math. 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.
Discret. Math. 312(2): 315-323, 2012.
How to play Reverse Hex.: Ryan B. Hayward, Bjarne Toft, Philip Henderson.
Discret. Math. 312(1): 148-156, 2012.
Vertex Disjoint Cycles of Different Length in Digraphs.: Michael A. Henning, Anders Yeo.
SIAM J. Discret. Math. 26(2): 687-694, 2012.
Girth and Total Domination in Graphs.: Michael A. Henning, Anders Yeo.
Graphs Comb. 28(2): 199-214, 2012.
Identifying Vertex Covers in Graphs.: Michael A. Henning, Anders Yeo.
Electron. J. Comb. 19(4): 32, 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.]
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.]
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.]
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.]
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.]
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.]
On the parameterized complexity of the workflow satisfiability problem.: Jason Crampton, Gregory Z. Gutin, Anders Yeo.
CCS: 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.
Electron. Notes Discret. Math. 37: 9-14, 2011.
On the problem of finding disjoint cycles and dicycles in a digraph.: Jørgen Bang-Jensen, Matthias Kriesell.
Comb. 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.
A depth-16 circuit for the AES S-box.: Joan Boyar, René Peralta.
IACR Cryptol. ePrint Arch. 2011: 332, 2011.
Online variable-sized bin packing with conflicts.: Leah Epstein, Lene M. Favrholdt, Asaf Levin.
Discret. Optim. 8(2): 333-343, 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.
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.
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.
Discret. Math. 311(17): 1918-1924, 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.
Discret. Math. 311(13): 1142-1149, 2011.
A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free.: Teresa W. Haynes, Michael A. Henning, Anders Yeo.
Discret. Optim. 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.
Electron. J. Comb. 18(1), 2011.
Perfect Matchings in Total Domination Critical Graphs.: Michael A. Henning, Anders Yeo.
Graphs Comb. 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 Discret. Math. 6(2), 2011.
A kernel of order 2k-c for Vertex Cover.: Arezou Soleimanfallah, Anders Yeo.
Discret. Math. 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 für 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.
Discret. Math. 310(9): 1424-1428, 2010.
The complexity of colouring by locally semicomplete digraphs.: Jørgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts.
Discret. Math. 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 Informatica 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. Discret. Math. 24(4): 1336-1355, 2010.
Double-Critical Graphs and Complete Minors.: Ken-ichi Kawarabayashi, Anders Sune Pedersen, Bjarne Toft.
Electron. J. Comb. 17(1), 2010.
Competitive analysis of the online inventory problem.: Kim S. Larsen, Sanne Wøhlk.
Eur. J. Oper. Res. 207(2): 685-696, 2010.
A parameter-adaptive dynamic programming approach for inferring cophylogenies.: Daniel Merkle, Martin Middendorf, Nicolas Wieseke.
BMC Bioinform. 11(S-1): 60, 2010.
A basic elementary extension of the Duchet-Meyniel theorem.: Anders Sune Pedersen, Bjarne Toft.
Discret. Math. 310(3): 480-488, 2010.
Preface.: Bjarne Toft.
Discret. Math. 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.
[Proceedings of the Twelfth International Conference on the Synthesis and Simulation of Living Systems, ALIFE 2010, 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.
Discret. Appl. Math. 157(11): 2536-2540, 2009.
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs.: Jørgen Bang-Jensen.
Discret. Math. 309(18): 5655-5667, 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.
Disjoint sub(di)graphs in digraphs.: Jørgen Bang-Jensen, Matthias Kriesell.
Electron. Notes Discret. Math. 34: 179-183, 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.
New logic minimization techniques with applications to cryptology.: Joan Boyar, René Peralta.
IACR Cryptol. ePrint Arch. 2009: 191, 2009.
Adapting to Dynamic Environments: Polyethism in Response Threshold Models for Social Insects.: Konrad Diwold, Daniel Merkle, Martin Middendorf.
Adv. Complex Syst. 12(3): 327-346, 2009.
Special issue on ant colony optimization.: Karl F. Doerner, Daniel Merkle, Thomas Stützle.
Swarm Intell. 3(1): 1-2, 2009.
Total Domination in Partitioned Graphs.: Allan Frendrup, Preben D. Vestergaard, Anders Yeo.
Graphs Comb. 25(2): 181-196, 2009.
Minimum Cost Homomorphism Dichotomy for Oriented Cycles.: Gregory Z. Gutin, Arash Rafiey, Anders Yeo.
Graphs Comb. 25(4): 521-531, 2009.
On the number of connected convex subgraphs of a connected acyclic digraph.: Gregory Z. Gutin, Anders Yeo.
Discret. Appl. Math. 157(7): 1660-1662, 2009.
Some complexity problems on single input double output controllers.: Katalin M. Hangos, Zsolt Tuza, Anders Yeo.
Discret. Appl. Math. 157(5): 1146-1158, 2009.
Extended shapes for the combinatorial design of RNA sequences.: Marc Hellmuth, Daniel Merkle, Martin Middendorf.
Int. J. Comput. Biol. Drug Des. 2(4): 371-384, 2009.
Total domination in 2-connected graphs and in graphs with no induced 6-cycles.: Michael A. Henning, Anders Yeo.
J. Graph Theory 60(1): 55-79, 2009.
Editorial: Artificial Life.: Konstantin Klemm, Daniel Merkle, Eckehard Olbrich.
Adv. Complex Syst. 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 für 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.]
Digraphs - Theory, Algorithms and Applications, Second Edition.: Jørgen Bang-Jensen, Gregory Z. Gutin.
Springer, 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.
Discret. Optim. 5(1): 121-137, 2008.
The minimum spanning strong subdigraph problem is fixed parameter tractable.: Jørgen Bang-Jensen, Anders Yeo.
Discret. Appl. Math. 156(15): 2924-2929, 2008.
Solving the Preserving Reversal Median Problem.: Matthias Bernt, Daniel Merkle, Martin Middendorf.
IEEE ACM Trans. Comput. Biol. Bioinform. 5(3): 332-347, 2008.
Tight bounds for the multiplicative complexity of symmetric functions.: Joan Boyar, René Peralta.
Theor. Comput. Sci. 396(1-3): 223-246, 2008.
The relative worst order ratio applied to seat reservation.: Joan Boyar, Paul Medvedev.
ACM Trans. Algorithms 4(4): 48:1-48:22, 2008.
On the adaptiveness of Quicksort.: Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz.
ACM J. Exp. 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 multipartite digraphs.: Gregory Z. Gutin, Arash Rafiey, Anders Yeo.
Discret. Appl. Math. 156(12): 2429-2435, 2008.
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs.: Gregory Z. Gutin, Arash Rafiey, Anders Yeo.
SIAM J. Discret. Math. 22(4): 1624-1639, 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.
Discret. Math. 308(15): 3412-3415, 2008.
On matching and total domination in graphs.: Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo.
Discret. Math. 308(11): 2313-2318, 2008.
Hypergraphs with large transversal number and with edge sizes at least 3.: Michael A. Henning, Anders Yeo.
J. Graph Theory 59(4): 326-348, 2008.
Total Domination in Graphs with Given Girth.: Michael A. Henning, Anders Yeo.
Graphs Comb. 24(4): 333-348, 2008.
Molecular docking with multi-objective Particle Swarm Optimization.: Stefan Janson, Daniel Merkle, Martin Middendorf.
Appl. Soft Comput. 8(1): 666-675, 2008.
A decentralization approach for swarm intelligence algorithms in networks applied to multi swarm PSO.: Stefan Janson, Daniel Merkle, Martin Middendorf.
Int. J. Intell. Comput. Cybern. 1(1): 25-45, 2008.
Swarm intelligence and signal processing [DSP Exploratory].: Daniel Merkle, Martin Middendorf.
IEEE Signal Process. Mag. 25(6): 152-158, 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 Biosci. 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. Bioinform. Comput. Biol. 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 B-Tree.: Rolf Fagerberg.
Encyclopedia of Algorithms, 2008.
Cache-Oblivious Model.: Rolf Fagerberg.
Encyclopedia of Algorithms, 2008.
Self-adaptive Worker-Helper Systems with Self-Organized Task Allocation.: Daniel Merkle, Martin Middendorf, Alexander Scheidler.
Organic Computing: 221-239, 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.
Discret. Optim. 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.
Discret. Appl. Math. 155(4): 442-456, 2007.
Using median sets for inferring phylogenetic trees.: Matthias Bernt, Daniel Merkle, Martin Middendorf.
Bioinform. 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.
Bioinform. 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 J. Exp. 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.
Comb. Probab. Comput. 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 Oper. Res. 2(1), 2007.
Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph.: Michael A. Henning, Anders Yeo.
Graphs Comb. 23(6): 647-657, 2007.
A New Upper Bound on the Total Domination Number of a Graph.: Michael A. Henning, Anders Yeo.
Electron. J. Comb. 14(1), 2007.
Total domination of graphs and small transversals of hypergraphs.: Stéphan Thomassé, Anders Yeo.
Comb. 27(4): 473-487, 2007.
Paths and cycles containing given arcs, in close to regular multipartite tournaments.: Anders Yeo.
J. Comb. Theory B 97(6): 949-963, 2007.
Relationships between total domination, order, size, and maximum degree of graphs.: Anders Yeo.
J. Graph Theory 55(4): 325-337, 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.
Discret. Optim. 3(1): 86-94, 2006.
Longest path partitions in generalizations of tournaments.: Jørgen Bang-Jensen, Morten Hegner Nielsen, Anders Yeo.
Discret. Math. 306(16): 1830-1839, 2006.
Genome Rearrangement Based on Reversals that Preserve Conserved Intervals.: Matthias Bernt, Daniel Merkle, Martin Middendorf.
IEEE ACM Trans. Comput. Biol. 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.
Domination analysis for minimum multiprocessor scheduling.: Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo.
Discret. Appl. Math. 154(18): 2613-2619, 2006.
On-line bin Packing with Two Item Sizes.: Gregory Z. Gutin, Tommy R. Jensen, Anders Yeo.
Algorithmic Oper. Res. 1(2), 2006.
Note on Upper Bounds for TSP Domination Number.: Gregory Z. Gutin, Angela Koller, Anders Yeo.
Algorithmic Oper. Res. 1(1), 2006.
Hamilton cycles in digraphs of unitary matrices.: Gregory Z. Gutin, Arash Rafiey, Simone Severini, Anders Yeo.
Discret. Math. 306(24): 3315-3320, 2006.
Minimum cost and list homomorphisms to semicomplete digraphs.: Gregory Z. Gutin, Arash Rafiey, Anders Yeo.
Discret. Appl. Math. 154(6): 890-897, 2006.
On n-partite Tournaments with Unique n-cycle.: Gregory Z. Gutin, Arash Rafiey, Anders Yeo.
Graphs Comb. 22(2): 241-249, 2006.
Level of repair analysis and minimum cost homomorphisms of graphs.: Gregory Z. Gutin, Arash Rafiey, Anders Yeo, Michael Tso.
Discret. Appl. Math. 154(6): 881-889, 2006.
Total Domination and Matching Numbers in Claw-Free Graphs.: Michael A. Henning, Anders Yeo.
Electron. 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 Bioinform. 7: 29, 2006.
Marco Dorigo and Thomas Stützle, Ant Colony Optimization, MIT Press (2004) ISBN 0-262-04219-3.: Daniel Merkle, Martin Middendorf.
Eur. J. Oper. Res. 168(1): 269-271, 2006.
Modeling Ant Brood ending Patterns with Cellular Automata.: Daniel Merkle, Martin Middendorf, Alexander Scheidler.
J. Cell. Autom. 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.]
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.]
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.]
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 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.
Discret. Appl. Math. 146(3): 245-256, 2005.
A problem of finding an acceptable variant in generalized project networks.: David Blokh, Gregory Z. Gutin, Anders Yeo.
Adv. Decis. Sci. 9(2): 75-81, 2005.
The Exact Multiplicative Complexity of the Hamming Weight Function: Joan Boyar, René Peralta.
Electron. Colloquium Comput. Complex. TR05, 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.
Discret. Optim. 2(1): 71-82, 2005.
Mediated digraphs and quantum nonlocality.: Gregory Z. Gutin, Nick S. Jones, Arash Rafiey, Simone Severini, Anders Yeo.
Discret. Appl. Math. 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 Informatica 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 B 95(1): 152-167, 2005.
Any 7-Chromatic Graphs Has K7 Or K4, 4 As A Minor.: Ken-ichi Kawarabayashi, Bjarne Toft.
Comb. 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.
Künstliche Intell. 19(4): 5-10, 2005.
On solving permutation scheduling problems with ant colony optimization.: Daniel Merkle, Martin Middendorf.
Int. J. Syst. Sci. 36(5): 255-266, 2005.
Reconstruction of the cophylogenetic history of related phylogenetic trees with divergence timing information.: Daniel Merkle, Martin Middendorf.
Theory Biosci. 123(4): 277-299, 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.
J. 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.
SCG: 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.]
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.]
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.]
2004
The structure of strong arc-locally semicomplete digraphs.: Jørgen Bang-Jensen.
Discret. Math. 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.
J. Graph Theory 46(4): 265-284, 2004.
Subgraphs in vertex neighborhoods of Kr-free graphs.: Jørgen Bang-Jensen, Stephan Brandt.
J. Graph Theory 47(1): 29-38, 2004.
When the greedy algorithm fails.: Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo.
Discret. Optim. 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.
Discret. Math. 276(1-3): 5-28, 2004.
Making a tournament k-arc-strong by reversing or deorienting arcs.: Jørgen Bang-Jensen, Anders Yeo.
Discret. Appl. Math. 136(2-3): 161-171, 2004.
Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs.: Jørgen Bang-Jensen, Anders Yeo.
Comb. 24(3): 331-349, 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.
J. Graph Theory 46(1): 48-56, 2004.
Dynamic Polyethism and Competition for Tasks in Threshold Reinforcement Models of Social Insects.: Daniel Merkle, Martin Middendorf.
Adapt. Behav. 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.
Discret. Math. 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. Sched. 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. Discret. 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.
J. 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é.
Discret. Appl. Math. 131(2): 555-559, 2003.
Small degree out-branchings.: Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo.
J. 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 Informatica 40(1): 3-35, 2003.
Packing paths in digraphs.: Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo.
J. 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.
Discret. Appl. Math. 129(2-3): 513-520, 2003.
Assignment problem based algorithms are impractical for the generalized TSP.: Gregory Z. Gutin, Anders Yeo.
Australas. J Comb. 27: 149-154, 2003.
Upper bounds on ATSP neighborhood size.: Gregory Z. Gutin, Anders Yeo.
Discret. Appl. Math. 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.
J. Supercomput. 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.
Discuss. Math. 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.
Discret. Appl. Math. 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.
J. 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 Comb. 18(3): 499-506, 2002.
Anti-matroids.: Gregory Z. Gutin, Anders Yeo.
Oper. Res. Lett. 30(2): 97-99, 2002.
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number.: Gregory Z. Gutin, Anders Yeo.
Discret. Appl. Math. 119(1-2): 107-116, 2002.
Orientations of digraphs almost preserving diameter.: Gregory Z. Gutin, Anders Yeo.
Discret. Appl. Math. 121(1-3): 129-138, 2002.
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP.: Gregory Z. Gutin, Anders Yeo, Alexey Zverovich.
Discret. Appl. Math. 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 Informatica 38(8): 565-586, 2002.
Modeling the Dynamics of Ant Colony Optimization.: Daniel Merkle, Martin Middendorf.
Evol. Comput. 10(3): 235-262, 2002.
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays.: Daniel Merkle, Martin Middendorf.
Genet. Program. Evolvable Mach. 3(4): 345-361, 2002.
Ant colony optimization for resource-constrained project scheduling.: Daniel Merkle, Martin Middendorf, Hartmut Schmeck.
IEEE Trans. Evol. Comput. 6(4): 333-346, 2002.
Formal language recognition by stochastic cellular automata.: Daniel Merkle, Thomas Worsch.
Fundam. Informaticae 52(1-3): 183-201, 2002.
Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic.: Meike Tewes, Lutz Volkmann, Anders Yeo.
Discret. Math. 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.]
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.]
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 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..]
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.]
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.]
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.]
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.]
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.]
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
Making a tournament k-arc-strong by reversing arcs.: Jørgen Bang-Jensen, Anders Yeo.
Electron. Notes Discret. Math. 8: 2-5, 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.
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.
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 W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich.
Eur. J. Oper. Res. 129(3): 555-568, 2001.
Remarks on hamiltonian digraphs.: Gregory Z. Gutin, Anders Yeo.
Australas. J Comb. 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.
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 Comb. 17(3): 473-477, 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.
Discret. Math. 229(1-3): 167-169, 2001.
Relaxed balance for search trees with local rebalancing.: Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen.
Acta Informatica 37(10): 743-763, 2001.
Relaxed Balance Using Standard Rotations.: Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer.
Algorithmica 31(4): 501-512, 2001.
Seat Reservation Allowing Seat Changes.: Joan Boyar, Susan Krarup, Morten N. Nielsen.
ATMOS, Electronic Notes in Theoretical Computer Science 50: 24-38, Elsevier, 2001.
[Workshop on Algorithmic MeThods and Models for Optimization of RailwayS, ATMOS 2001, Satellite Workshop of ICALP 2001, Crete, Greece, July 13, 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.
Electron. Notes Discret. Math. 5: 15-18, 2000.
Convex-Round and Concave-Round Graphs.: Jørgen Bang-Jensen, Jing Huang, Anders Yeo.
SIAM J. Discret. Math. 13(2): 179-193, 2000.
Complementary cycles containing prescribed vertices in tournaments.: Jørgen Bang-Jensen, Yubao Guo, Anders Yeo.
Discret. Math. 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.
Discret. Math. 214(1-3): 101-112, 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.
Short Non-Interactive Cryptographic Proofs.: Joan Boyar, Ivan Damgård, René Peralta.
J. Cryptol. 13(4): 449-472, 2000.
Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian.: Yubao Guo, Meike Tewes, Lutz Volkmann, Anders Yeo.
Discret. Math. 212(1-2): 91-100, 2000.
On the Hajo's number of graphs.: Gregory Z. Gutin, Alexandr V. Kostochka, Bjarne Toft.
Discret. Math. 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.
Discret. Math. 222(1-3): 269-274, 2000.
Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian.: Gregory Z. Gutin, Anders Yeo.
J. Comb. Theory B 78(2): 232-242, 2000.
Kings in semicomplete multipartite digraphs.: Gregory Z. Gutin, Anders Yeo.
J. Graph Theory 33(3): 177-183, 2000.
AVL Trees with Relaxed Balance.: Kim S. Larsen.
J. Comput. Syst. Sci. 61(3): 508-522, 2000.
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.]
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.]
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.
Discret. Math. 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. Discret. Math. 12(2): 160-207, 1999.
A note on vertex pancyclic oriented graphs.: Jørgen Bang-Jensen, Yubao Guo.
J. 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.
Discret. Appl. Math. 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.
Discret. Appl. Math. 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.
Comput. Oper. Res. 26(4): 321-327, 1999.
On Grouping in Relational Algebra.: Kim S. Larsen.
Int. J. Found. Comput. Sci. 10(3): 301-311, 1999.
Partially persistent search trees with transcript operations.: Kim S. Larsen.
Discret. Math. Theor. Comput. Sci. 3(3): 95-107, 1999.
Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5.: Anders Yeo.
J. Graph Theory 32(2): 137-152, 1999.
Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments.: Anders Yeo.
J. Graph Theory 32(2): 123-136, 1999.
How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?: Anders Yeo.
Graphs Comb. 15(4): 481-493, 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.
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 W. Glover, Gregory Z. Gutin, Anders Yeo, Alexey Zverovich.
WAE, 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
Maximal and Minimal Vertex-Critical Graphs of Diameter Two.: Jing Huang, Anders Yeo.
J. Comb. Theory B 74(2): 311-325, 1998.
Kings in quasi-transitive digraphs.: Jørgen Bang-Jensen, Jing Huang.
Discret. Math. 185(1-3): 19-27, 1998.
Generalizations of tournaments: A survey.: Jørgen Bang-Jensen, Gregory Z. Gutin.
J. Graph Theory 28(4): 171-202, 1998.
Alternating cycles and trails in 2-edge-coloured complete multigraphs.: Jørgen Bang-Jensen, Gregory Z. Gutin.
Discret. Math. 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.
J. 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.
Discret. Appl. Math. 82(1-3): 247-250, 1998.
Edge-Connectivity Augmentation Preserving Simplicity.: Jørgen Bang-Jensen, Tibor Jordán.
SIAM J. Discret. Math. 11(4): 603-623, 1998.
Adding and Reversing Arcs in Semicomplete Digraphs.: Jørgen Bang-Jensen, Tibor Jordán.
Comb. Probab. Comput. 7(1): 17-25, 1998.
Note on alternating directed cycles.: Gregory Z. Gutin, Benny Sudakov, Anders Yeo.
Discret. Math. 191(1-3): 101-107, 1998.
Parametric Permutation Routing via Matchings.: Peter Høyer, Kim S. Larsen.
Nord. J. Comput. 5(2): 105-114, 1998.
On interval colourings of bi-regular bipartite graphs.: Denis Hanson, C. O. M. Loten, Bjarne Toft.
Ars Comb. 50, 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.
Amortized Constant Relaxed Rebalancing Using Standard Rotations.: Kim S. Larsen.
Acta Informatica 35(10): 859-874, 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.
Discret. Math. 167-168: 101-114, 1997.
Paths and cycles in extended and decomposable digraphs, .: Jørgen Bang-Jensen, Gregory Z. Gutin.
Discret. Math. 164(1-3): 5-19, 1997.
Alternating cycles and paths in edge-coloured multigraphs: A survey.: Jørgen Bang-Jensen, Gregory Z. Gutin.
Discret. Math. 165-166: 39-60, 1997.
Vertex heaviest paths and cycles in quasi-transitive digraphs.: Jørgen Bang-Jensen, Gregory Z. Gutin.
Discret. Math. 163(1-3): 217-223, 1997.
Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments.: Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo.
Comb. Probab. Comput. 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.
A Note on Alternating Cycles in Edge-Coloured Graphs.: Anders Yeo.
J. Comb. Theory B 69(2): 222-225, 1997.
One-diregular subgraphs in semicomplete multipartite digraphs.: Anders Yeo.
J. Graph Theory 24(2): 175-185, 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.
J. 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.
Discret. Math. 161(1-3): 1-12, 1996.
Sufficient conditions for a digraph to be Hamiltonian.: Jørgen Bang-Jensen, Gregory Z. Gutin, Hao Li.
J. Graph Theory 22(2): 181-187, 1996.
On k-strong and k-cyclic digraphs.: Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo.
Discret. Math. 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.
Discret. Appl. Math. 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.
J. Graph Theory 20(2): 255-265, 1995.
Quasi-transitive digraphs.: Jørgen Bang-Jensen, Jing Huang.
J. 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. Discret. Math. 8(2): 155-178, 1995.
Weakly Hamiltonian-connected ordinary multipartite tournaments.: Jørgen Bang-Jensen, Gregory Z. Gutin, Jing Huang.
Discret. Math. 138(1-3): 63-74, 1995.
Hereditarily hard H-colouring problems.: Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray.
Discret. Math. 138(1-3): 75-92, 1995.
Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments.: Jørgen Bang-Jensen, Yannis Manoussakis.
J. Comb. Theory 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 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.
Discret. Math. 128(1-3): 395-398, 1994.
Cycles Through k Vertices in Bipartite Tournaments.: Jørgen Bang-Jensen, Yannis Manoussakis.
Comb. 14(2): 243-246, 1994.
Bounds on Certain Multiplications of Affine Combinations.: Joan Boyar, Faith E. Fich, Kim S. Larsen.
Discret. Appl. Math. 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 B 59(2): 267-287, 1993.
Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs.: Jørgen Bang-Jensen, Pavol Hell.
Discret. Appl. Math. 41(1): 75-79, 1993.
On the Communication Complexity of Zero-Knowledge Proofs.: Joan Boyar, Carsten Lund, René Peralta.
J. Cryptol. 6(2): 65-85, 1993.
1992
On the structure of locally semicomplete digraphs.: Jørgen Bang-Jensen.
Discret. Math. 100(1-3): 243-265, 1992.
On the complexity of colouring by superdigraphs of bipartite graphs.: Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray.
Discret. Math. 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. Discret. Math. 5(3): 366-376, 1992.
Unsolved problems presented at the Julius Petersen Graph Theory Conference.: Jørgen Bang-Jensen, Bjarne Toft.
Discret. Math. 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.
Discret. Math. 100(1-3): 83-97, 1992.
Julius Petersen 1839-1910 a biography.: Jesper Lützen, Gert Sabidussi, Bjarne Toft.
Discret. Math. 100(1-3): 9-82, 1992.
A New Formalism for Relational Algebra.: Kim S. Larsen, Michael I. Schwartzbach, Erik Meineche Schmidt.
Inf. Process. Lett. 41(3): 163-168, 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 B 51(1): 1-23, 1991.
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.: Joan Boyar, Katalin Friedl, Carsten Lund.
J. Cryptol. 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.
J. 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.
Discret. Appl. Math. 26(1): 1-23, 1990.
A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs.: Joan Boyar, Stuart A. Kurtz, Mark W. Krentel.
J. Cryptol. 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 pseudo-random number generators.: Joan Boyar.
J. ACM 36(1): 129-141, 1989.
Inferring Sequences Produced by a Linear Congruential Generator Missing Low-Order Bits.: Joan Boyar.
J. Cryptol. 1(3): 177-184, 1989.
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.]
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.]
1988
The Complexity of Colouring by Semicomplete Digraphs.: Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray.
SIAM J. Discret. 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.
J. Graph Theory 11(2): 191-196, 1987.
Cyclic coloration of 3-polytopes.: Michael D. Plummer, Bjarne Toft.
J. 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.]
1981
Non-separating induced cycles in graphs.: Carsten Thomassen, Bjarne Toft.
J. Comb. Theory B 31(2): 199-224, 1981.
1980
The enumeration problem for color critical linear hypergraphs.: H. L. Abbott, A. Liu, Bjarne Toft.
J. Comb. Theory B 29(1): 106-115, 1980.
1974
On critical subgraphs of colour-critical graphs.: Bjarne Toft.
Discret. Math. 7(3-4): 377-392, 1974.