Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, and Petra Wolf: Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. In Proceedings of the 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'23), Nový Smokovec, Slovakia, January 2023. Volume 13878 of LNCS, pages 283–297, Springer (original publication).
Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge: Computing Optimal Tree Ensembles: In Proceedings of the 2023 International Conference on Machine Learning (ICML'23), Hawaii, USA, July 2023, to appear.
Christian Komusiewicz, Jannis Schramek and Frank Sommer: On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics. In Proceedings of the 2023 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA'23), Seattle, USA, Mai 2023, to appear.
Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz and Frank Sommer: Exact Algorithms for Group Closeness Centrality. In Proceedings of the 2023 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA'23), Seattle, USA, Mai 2023, to appear.
Christian Komusiewicz, Nils Morawietz: Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial. In Proceedings of the 17th International Symposium on Parameterized and Exact Computation (IPEC'22), September 7-9, 2022, Potsdam, Germany, to appear. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Christian Komusiewicz, Nils Morawietz: Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. In Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS'22). Volume 241 of Leibniz International Proceedings in Informatics (LIPIcs), pages 66:1--66:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: On Critical Node Problems with Vulnerable Vertices. In Proceedings of the 33rd International Workshop on Combinatorial Algorithms (IWOCA'22), Trier, Germany, June 2022. Volume 13270 of LNCS, pages 494-508, Springer. (original publication)
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, and Frank Sommer: Covering Many (or Few) Edges with k Vertices in Sparse Graphs. In Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS'22), Marseille, France, March 2022. Volume 219 of LIPIcs, pages 42:1-42:18, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Alexander Bille: Finding Optimal Blockmodels. Masterarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, May 2022.
Ben Louis Dietz: Effiziente Algorithmen für das Strong c-Closure Problem. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, July 2022.
Kevin Gieswein: Suchbaumalgorithmen für Best Match Graph Completion. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, October 2022.
Moritz Groß: Algorithm Engineering für Max Cut mit Cardinality Constraints. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, cktober 2022.
Marie Kastning: Algorithm Engineering for the Partial Dominating Set Problem. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, April 2022.
Sven Löchte: Coverage Centrality Improvement by Edge Insertion. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, November 2022.
Lars Rafeldt: Complexity of Vertex Switching Problems. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, April 2022.
Jannis Schramek: Effiziente Algorithmen für Group Coverage Centrality. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, September 2022.
Laurent Bulteau, Guillaume Fertin, Géraldine Jean, and Christian Komusiewicz: Sorting by Multi-Cut Rearrangements. In Proceedings of the 47th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'21), Bozen-Bolzano, Italy 2021. LNCS, Springer.
Niels Grüttemeier, Christian Komusiewicz, and Nils Morawietz: On the Parameterized Complexity of Polytree Learning. In Proceedings of the International Joint Conferences on Artificial Intelligence (IJCAI'21), Montreal, Canada, August 2021, to appear.
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: Preventing Small (s,t)-Cuts by Protecting Edges. In Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'21), Warsaw, Poland, June 2021, to appear.
Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Essentially Tight Kernels for (Weakly) Closed Graphs. In Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC'21), Fukuoka, Japan, December 2021. Volume 212 of LIPIcs, pages 35:1-35:15, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Nils Morawietz and Petra Wolf: A Timecop's Chase Around the Table. In Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science (MFCS'21), August 23-27, 2021, Tallinn, Estonia. Volume 202 of LIPIcs, pages 77:1-77:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Niklas Diehl: Ein aufzählbasierter Algorithmus für das k-Cardinality-Problem. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, December 2021.
Martin Erhardt: Turbocharging von Greedyheuristiken für das Travelling-Salesperson-Problem. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, November 2021.
Daniel Krambrock: Algorithm Engineering für lokale Suchalgorithmen zum Lernen von Bayesnetzwerken. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, April 2021.
Tim Luckhardt: 2-Colored Split Graph Editign and Related Problems. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, November 2021.
Luca Pascal Staus: Algorithm Engineering für Group Closeness Centrality. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, September 2021.
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, and Frank Sommer: String Factorizations under Various Collision Constraints. In Proceedings of the Thirty-First Annual Symposium on Combinatorial Pattern Matching (CPM'20), Copenhagen, Denmark, June 2020. Volume 161 of LIPIcs, pages 17:1-17:14, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. In Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC'20), Hong Kong, China, December 2020. Volume 181 of LIPIcs, pages 20:1-20:17, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Exploiting c-Closure in Kernelization Algorithms for Graph Problems. In Proceedings of the 28th Annual European Symposium on Algorithms (ESA'20), Pisa, Italy, September 2020. Volume 173 of LIPIcs, pages 65:1–65:17, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer. Colored cut games. In Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), Goa, India, December 2020, volume 182 of LIPIcs, 30:1-30:17, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Nils Morawietz, Carolin Rehs, and Mathias Weller: A Timecop’s Work is Harder Than You Think. In Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS'20), Prague, Czech Republic, August 2020, volume 170 of LIPIcs, pages 71:1–71:14. Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Alessia Bäcker: Algorithm Engineering für das 3-Club Problem. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, December 2020.
Alexander Lauer: Strukturelle Parameter für das Critical-Node-Cut Problem. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, February 2020.
Markus Brill, Piotr Faliszewski, Frank Sommer, and Nimrod Talmon: Approximation Algorithms for BalancedCC Multiwinner Rules. In Proceedings of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'19), Montreal, Canada, May 2019, pages 494–502, IFAAMAS.
Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag and Frank Sommer: Destroying Bicolored P3s by Deleting Few Edges. In Proceedings of the 15th Conference on Computability in Europe (CiE'19), Durham, England, July 2019, Volume 11558 of LNCS, pages 193–204, Springer (original publication).
Johannes Frankenau: Algorithm Engineering for Identifying Core-Periphery Structures in Social Networks. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, January 2019.
Guillaume Fertin, Julien Fradin, and Christian Komusiewicz: On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. In Proceedings of the 29th Annual Symposium on Combinatorial Pattern Matching, (CPM'18), Qingdao, China, July 2018. Volume 105 of LIPIcs, pages 17:1–17:15, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen: Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. In Proceedings of the 26th Annual European Symposium on Algorithms (ESA'18), Helsinki, August 2018. Volume 112 of LIPIcs, pages 51:1–51:14, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Jannik Schestag: Liechtenstein-P3s in Two-Colored Graphs. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, December 2018.
Philip Steinbrecher: Packingbasierte Datenreduktion und untere Schranken für Cluster Editing. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, September 2018.
Veronika Stimpert: Algorithmen für Module Map Probleme. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, September 2018.
Laurent Bulteau, Guillaume Fertin, and Christian Komusiewicz: Beyond Adjacency Maximization: Scaffold Filling for New String Distances. In Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, (CPM'17), Warsaw, Poland, July 2017. Volume 78 of LIPIcs, pages 27:1–27:17, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, and Nimrod Talmon: When Can Graph Hyperbolicity Be Computed in Linear Time? In Proceedings of the Algorithms and Data Structures Symposium (WADS'17), Newfoundland, Canada, August 2017. Volume 10389 of LNCS, pages 397–408, Springer (original publication).
Christian Komusiewicz, Mateus de Oliveira Oliveira, and Meirav Zehavi: Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. In Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, (CPM'17), Warsaw, Poland, July 2017. Volume 78 of LIPIcs, pages 11:1–11:17, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, and Manuel Sorge: Twins in Subdivision Drawings of Hypergraphs. In Proceedings of the 24th International Symposium on Graph Drawing & Network Visualization (GD'16), Athens, Greece, September 2016. Volume 9801 of LNCS, pages 67–80, Springer (original publication).
René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier , Manuel Sorge, and Toby Walsh: h-Index Manipulation by Undoing Merges. In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI'16), The Hague, Netherlands, August 2016. Volume 285 of Frontiers in Artificial Intelligence and Applications, pages 895–903, IOS Press (original publication).
Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond: The First Parameterized Algorithms and Computational Experiments Challenge. In Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC'16), Århus, August 2016. Volume 63 of LIPIcs, pages 30:1-30:9, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Guillaume Fertin and Christian Komusiewicz: Graph Motif problems parameterized by dual. In Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM'16), Tel Aviv, June 2016. Volume 54 of LIPIcs, pages 7:1–7:12, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen: Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. In Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT'16), Reykjavik, June 2016. Volume 53 of LIPIcs, pages 14:1–14:14, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
René van Bevern, Christian Komusiewicz, and Manuel Sorge: Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. In Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'15), Patras, Greece, September 2015. Volume 48 of OASIcs, pages 130–143, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, and Barak Navon: Parameterized Complexity of Critical Node Cuts. In Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC'15), Patras, Greece, September 2015. Volume 43 of LIPIcs, pages 343–354, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
Falk Hüffner, Christian Komusiewicz, and Manuel Sorge: Finding Highly Connected Subgraphs. In Proceedings of the 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'15), Pec pod Sněžkou, Czech Republic, January 2015. Volume 8939 of Lecture Notes in Computer Science, pages 254–265, Springer (original publication).
Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, and Sebastian Wernicke: Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems. In: Bioinformatics Volume II: Structure, Function and Applications. Series: Methods in Molecular Biology, Springer.
Christian Komusiewicz: Partially Polynomial Kernels. In: Encyclopedia of Algorithms, Springer (original publication).
Guillaume Fertin, Shahrad Jamshidi, and Christian Komusiewicz: Towards an Algorithmic Guide to Spiral Galaxies. In Proceedings of the Seventh International Conference on Fun with Algorithms (FUN'14), Lipari Island, Italy, July 2014. Volume 8496 of LNCS, pages 171–182, Springer (original publication).
Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, and Martin Rötzschke: The Parameterized Complexity of the Rainbow Subgraph Problem. In Proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'14), Domaine de Chalès, France, June 2014. Volume 8747 of LNCS, pages 287–298, Springer (original publication).
Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, and Ondřej Suchý: On Explaining Integer Vectors by few Homogenous Segments. In Proceedings of the Algorithms and Data Structures Symposium (WADS'13), London, Ontario, Canada, August 2013. Volume 8037 of LNCS, pages 207–218, Springer (original publication).
Sepp Hartung, Christian Komusiewicz, and André Nichterlein: On Structural Parameterizations for the 2-Club Problem. In Proceedings of the 39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'13), Špindlerův Mlýn, Czech Republic, January 2013. Volume 7741 of LNCS, pages 233–243, Springer (original publication).
Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, and Frances Rosamond: Train Marshalling is Fixed Parameter Tractable. In Proceedings of the Sixth International Conference on Fun with Algorithms (FUN'12), Venice, Italy, June 2012. Volume 7288 of LNCS, pages 51–56, Springer (original publication).
Christian Komusiewicz and Rolf Niedermeier: New Races in Parameterized Algorithmics. In Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS'12), Bratislava, Slovakia, August 2012. Volume 7464 of LNCS, pages 19–30, Springer (original publication).
Christian Komusiewicz and Manuel Sorge: Finding Dense Subgraphs of Sparse Graphs. In Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC'12), Ljubljana, Slovenia, September 2012. Volume 7535 of LNCS, pages 242–251, Springer (original publication).
Christoph Schmidt, Thomas Weiss, Christian Komusiewicz, Herbert Witte, and Lutz Leistritz: An Analytical Approach to Network Motif Detection in Samples of Networks with Pairwise Different Vertex Labels. Computational and Mathematical Methods in Medicine, Volume 2012, Article ID 910380 (original publication).
Christian Komusiewicz and Johannes Uhlmann: Alternative Parameterizations for Cluster Editing. In Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11), Nový Smokovec, Slovakia, January 2011. Volume 6543 of LNCS, pages 344–355, Springer (original publication).
René van Bevern, Christian Komusiewicz, Hannes Moser, and Rolf Niedermeier: Measuring Indifference: Unit Interval Vertex Deletion. In Proceedings of the 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG'10), Zarós (Crete), Greece, June 2010. Volume 6410 of LNCS, pages 232–243, Springer (original publication) .
Daniel Brügmann, Christian Komusiewicz, and Hannes Moser: On Generating Triangle-Free Graphs. In Proceedings of the DIMAP Workshop on Algorithmic Graph Theory (AGT'09), Warwick, England, March 2009. Electronic Notes in Discrete Mathematics 32, pages 51–58, Elsevier (original publication).
Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, and Johannes Uhlmann: Graph-Based Data Clustering with Overlaps. In Proceedings of the 15th International Computing and Combinatorics Conference (COCOON'09), Niagara Falls, USA, June 2009. Volume 5609 of LNCS, pages 516–526, Springer (original publication).
Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, and Johannes Uhlmann: On Making Directed Graphs Transitive. In Proceedings of the 11th Algorithms and Data Structures Symposium (WADS'09), Banff, Canada, August 2009. Volume 5664 of LNCS, pages 542–553. Springer (original publication).
Jiong Guo, Falk Hüffner, Christian Komusiewicz, and Yong Zhang: Improved algorithms for bicluster editing. In Proceedings of the 5th Annual Conference on Theory and Applications of Models of Computation (TAMC'08), Xian, China. April 2008. Volume 4978 of LNCS, pages 451–462, Springer (original publication).
Falk Hüffner, Christian Komusiewicz, Hannes Moser, and Rolf Niedermeier: Enumerating isolated cliques in synthetic and financial networks. In Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08), St. John's, Newfoundland, Canada. August 2008. Volume 5165 of LNCS, pages 405–416, Springer (original publication).
Christian Komusiewicz and Johannes Uhlmann: A Cubic-Vertex Kernel for Flip Consensus Tree. In Proceedings of the 28th Foundations of Software Technology and Theoretical Computer Science conference (FSTTCS'08), Bangalore, India. December 2008. Volume 08004 of Dagstuhl Seminar Proceedings, pages 280–291, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany.
Christian Komusiewicz: Various Isolation Concepts for the Enumeration of Dense Subgraphs. Diplomarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, März 2007.