# Publications at ISAAC

Below you find the list of all publications of the Algorithm Engineering group presented at the International Symposium on Algorithms and Computation (ISAAC).

You can view all publications of the current members of the Algorithm Engineering group. For other listings, please see:

- years: 2020, 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010
- researchers: Prof. Dr. Tobias Friedrich, Dr. Thomas Bläsius, Dr. Katrin Casel, Dr. Ágnes Cseh, Dr. Andreas Göbel, Dr. Davis Issac, Dr. Timo Kötzing, Dr. Martin Krejca, Dr. Pascal Lenzner
- PhD students: Vanja Doskoč, Ziena Elijazyfer, Philipp Fischbeck, Maximilian Katzmann, Ardalan Khazraei, Gregor Lagodzinski, Anna Melnichenko, Louise Molitor, Stefan Neubert, Francesco Quinzan, Ralf Rothenberger, Martin Schirneck, Karen Seidel, Christopher Weyand
- theory conferences: ICALP, MFCS, SAGT, STACS, STOC, WINE

algorithm conferences: ALENEX, ESA, GD, ISAAC, SODA, SPAA, SWAT, WAW - artificial intelligence conferences: AAAI, AAMAS, ALT, COLT, ECAI, ICAPS, IJCAI, SAT

evolutionary computation conferences: CEC, EMO, EvoCOP, FOGA, GECCO, PPSN

2016 [ to top ]

- Building Clusters with Lower-Bounded Sizes. International Symposium on Algorithms and Computation (ISAAC) 2016: 4:1-4:13

2015 [ to top ]

- Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. International Symposium Algorithms and Computation (ISAAC) 2015: 176-187
- The Benefit of Recombination in Noisy Evolutionary Search. International Symposium of Algorithms and Computation (ISAAC) 2015: 140-150
- Unbounded Discrepancy of Deterministic Random Walks on Grids. International Symposium on Algorithms and Computation (ISAAC) 2015: 212-222

2012 [ to top ]

- Parameterized Clique on Scale-Free Networks. International Symposium on Algorithms and Computation (ISAAC) 2012: 659-668

2011 [ to top ]

- Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. International Symposium on Algorithms and Computation (ISAAC) 2011: 190-199

2008 [ to top ]

- Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. International Symposium of Algorithms and Computation (ISAAC) 2008: 692-703
- Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. International Symposium on Algorithms and Computation (ISAAC) 2008: 436-447

2007 [ to top ]

- Average-Case Analysis of Online Topological Ordering. International Symposium on Algorithms and Computation (ISAAC) 2007: 464-475

2006 [ to top ]

- Deterministic Random Walks on the Two-Dimensional Grid. International Symposium on Algorithms and Computation (ISAAC) 2006: 474-483