Hauptinhalt

Publikationen

2023

Konferenzartikel

• 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, Januar 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.

Zeitschriftenartikel

• Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. Discrete Mathematics & Theoretical Computer Science. vol. 25 no. 1.
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. Algorithmica, 2023.
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Essentially Tight Kernels for (Weakly) Closed Graphs. Algorithmica, 2023.

2022

Konferenzartikel

• Jaroslav Garvardt, Christian Komusiewicz, and Frank Sommer: The Parameterized Complexity of s-Club with Triangle and Seed Constraints. In Proceedings of the 33rd International Workshop on Combinatorial Algorithms (IWOCA'22), Trier, Deutschland, Juni 2022. Volume 13270 of LNCS, pages 313-326, Springer, (original publication).
• 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, Deutschland, Juni 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, Frankreich, März 2022. Volume 219 of LIPIcs, pages 42:1-42:18, Schloss Dagstuhl — Leibniz-Zentrum für

Zeitschriftenartikel

• Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, and Van Bang Le: Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. Journal of Computer and System Sciences 123: 76-102, 2022 (original publication).
• Niels Grüttemeier and Christian Komusiewicz: Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. Journal of Artificial Intelligence Research 74:1225–1267, 2022 (original publication).
• Tomohiro Koana, Christian Komusiewicz, and Frank Sommer: Exploiting c-Closure in Kernelization Algorithms for Graph Problems. SIAM Journal on Discrete Mathematics 36(4), 2798–2821 (original publication).
• Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: Colored cut games. Theoretical Computer Science 936: 13-32, 2022 (originial publication).
• Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. Theory of Computing Systems 66(5): 1019–1045, 2022.

Abschlussarbeiten

• Alexander Bille: Finding Optimal Blockmodels. Masterarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Mai 2022.
• Ben Louis Dietz: Effiziente Algorithmen für das Strong c-Closure Problem. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Juli 2022.
• Kevin Gieswein: Suchbaumalgorithmen für Best Match Graph Completion. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Oktober 2022.
• Moritz Groß: Algorithm Engineering für Max Cut mit Cardinality Constraints. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Oktober 2022.
• Niels Grüttemeier: Parameterized Algorithmics for Graph-Based Data Analysis. Dissertation, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Mai 2022 (original publication).
• Emanuel Herrendorf: On the Complexity of Community-aware Network Sparsification. Masterarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, März 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.
• Frank Sommer: On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations. Dissertation, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, November 2022.

2021

Konferenzartikel

• 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.
• Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, and Van Bang Le: Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS'21), Saarbrücken, Deutschland, März 2021. Volume 187 of LIPIcs, pages 37:1-37:18, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
• Niels Grüttemeier, Christian Komusiewicz, and Nils Morawietz: Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. In Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI'21), Virtual Conference, Worldwide. Pages 12328–12335, AAAI Press. (original publication)
• 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, Juni 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, Dezember 2021. Volume 212 of LIPIcs, pages 35:1-35:15, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
• Christian Komusiewicz and Nils Morawietz: Can Local Optimality Be Used for Efficient Data Reduction? In Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC'21), Virtual Event, May 10-12, 2021. Volume 12701 of LNCS, pages 354-366, Springer (original publication).
• 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.

Zeitschriftenartikel

• Laurent Bulteau, Niels Grüttemeier, Manuel Sorge, and Christian Komusiewicz: Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors. Journal of Computer and System Sciences 120, 75-96, (original publication).
• Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, and Frank Sommer: Destroying Bicolored P3s by Deleting Few Edges. Discrete Mathematics & Theoretical Computer Science vol. 23 no. 1, (original publication).
• Christian Komusiewicz and Frank Sommer: Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. Discrete Applied Mathematics, 303:262–282, 2021 (original publication).
   

Abschlussarbeiten

• Niklas Diehl: Ein aufzählbasierter Algorithmus für das k-Cardinality-Problem. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Dezember 2021. 
• Martin Erhardt: Turbocharging von Greedyheuristiken für das Travelling-Salesperson-Problem. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, November 2021. 
• Jaroslav Garvardt: Complexity Analysis of Graph-Based Orthology Assignment. Masterarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Juni 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. 
• Jannik Schestag: Critical Node Problem with Vulnerable Nodes. Masterarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Oktober 2021.
• Luca Pascal Staus: Algorithm Engineering für Group Closeness Centrality. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, September 2021.

2020

Konferenzartikel

• Niels Grüttemeier and Christian Komusiewicz: Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. In Proceedings of the International Joint Conferences on Artificial Intelligence (IJCAI'20), Yokohama, Japan, July 2020. pages 4245-4251, ijcai.org (original publication).
• Niels Grüttemeier, Christian Komusiewicz, and Nils Morawietz: Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. In Proceedings of the Seventeenth Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'20), Tórshavn, Faroe Islands, Denmark, June 2020. Volume 162 of LIPIcs, pages 26:1-26:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. (original publication)
• 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.
• Christian Komusiewicz and Frank Sommer: FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. In Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX’20), Salt Lake City, USA, January 2020. Pages 12-26, SIAM (original publication).
• 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, Dezember 2020, volume 182 of LIPIcs, 30:1-30:17, Schloss Dagstuhl — Leibniz-Zentrum für Informatik
• Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer: Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'20), Limassol, Cyprus, January 2020. Volume 12011 of LNCS, pages 248-259, Springer (original publication).
• 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.

Zeitschriftenartikel

• Guillaume Fertin and Christian Komusiewicz: Graph Motif problems parameterized by dual. Journal of Graph Algorithms and Applications 24(3):371–396, 2020.
• Niels Grüttemeier and Christian Komusiewicz: On the Relation of Strong Triadic Closure and Cluster Deletion. Algorithmica 82(4):853–880 (original publication).
• Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen: Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. SIAM Journal on Discrete Mathematics 34(1), 640–681 (original publication).
• Christian Komusiewicz, Mateus de Oliveira Oliveira, and Meirav Zehavi: Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. Theoretical Computer Science 847:27-38, 2020 (original publication).
• Christian Komusiewicz and Frank Sommer: Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. Discrete Applied Mathematics, (original publication).
• Dieter Kratsch, Christian Komusiewicz, and Van Bang Le: Matching Cut: Kernelization, Single-Exponential FPT, and Exact Exponential Algorithms. Discrete Applied Mathematics 283:44–58, 2020 (original publication).
• Frank Sommer and Christian Komusiewicz: Parameterized Algorithms for Module Map Problems. Discrete Applied Mathematics 283:396–416, 2020 (original publication).

Abschlussarbeiten

• Alessia Bäcker: Algorithm Engineering für das 3-Club Problem. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Dezember 2020.
• Nils Jakob Eckstein: Destroying Multicolored Paths and Cycles in Edge-colored Graphs. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Juli 2020.
• Philipp Heinrich Keßler: Algorithm Engineering for the Triangle-2-Club Problem. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, November 2020.
• Alexander Lauer: Strukturelle Parameter für das Critical-Node-Cut Problem. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Februar 2020.
• Béla Neuendorf: On Strong Triadic Closure with Edge Insertion. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, Mai 2020.

2019

Konferenzartikel

• 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.
• Laurent Bulteau, Niels Grüttemeier, Manuel Sorge, and Christian Komusiewicz: Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors. In Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC'19), Rome, Italy, May 2019, Volume 11485 of LNCS, pages 99–111, Springer (original publication).
• 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).
• Christian Komusiewicz and Frank Sommer: Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. In Proceedings of the 45th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'19), Nový Smokovec, Slovakia, January 2019, Volume 11376 of LNCS, pages 272–284, Springer (original publication).

Zeitschriftenartikel

• Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge: Assessing the computational complexity of multilayer subgraph detection. Network Science 7(2): 215–241 (original publication)
• Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, and Nimrod Talmon: When Can Graph Hyperbolicity Be Computed in Linear Time? Algorithmica 81(5): 2016–2045 (original publication).
• Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, and Marten Picker: Exact algorithms for finding well- connected 2- clubs in sparse real- world graphs: Theory and experiments. European Journal of Operational Research 275(3): 846–864 (original publication).

Abschlussarbeiten

• Johannes Frankenau: Algorithm Engineering for Identifying Core-Periphery Structures in Social Networks. Bachelorarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, January 2019.
• Nils Morawietz: Computational Complexity of Network Robustness in Edge-Colored Graphs. Masterarbeit, Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, September 2019.

2018

Konferenzartikel

• 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.
• Niels Grüttemeier and Christian Komusiewicz: On the Relation of Strong Triadic Closure and Cluster Deletion. In Proceedings of the 44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'18), Cottbus, Germany, June 2018, Volume 11159 of LNCS, pages 239-251, Springer (original publication).
• 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.
• Dieter Kratsch, Christian Komusiewicz, and Van Bang Le: Matching Cut: Kernelization, Single-Exponential FPT, and Exact Exponential Algorithms. In Proceedings of the 13th International Symposium on Parameterized and Exact Computation (IPEC'18), Helsinki, August 2018. Volume 115 of LIPIcs, pages 19:1–19:13, Schloss Dagstuhl — Leibniz-Zentrum für Informatik.
• Frank Sommer and Christian Komusiewicz: Parameterized Algorithms for Module Map Problems. In Proceedings of the Fifth International Symposium on Combinatorial Optimization (ISCO'18), Marrakesh, Morocco, April 2018, Volume 10856 of LNCS, pages 376-388, Springer (original publication).

Zeitschriftenartikel

• René van Bevern, Vincent Froese, and Christian Komusiewicz: Parameterizing edge modification problems above lower bounds. Theory of Computing Systems 62(3): 739–770, 2018 (original publication).
• Guillaume Fertin, Falk Hüffner, Christian Komusiewicz, and Manuel Sorge: Matching Algorithms for Assigning Orthologs after Genome Duplication Events. Computational Biology and Chemistry 74: 379–390, 2018 (APBC'18 special issue).
• Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, and Erik Jan van Leeuwen: Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. Journal of Computer and System Sciences 92: 22–47, 2018 (original publication).
• Christian Komusiewicz: Tight running time lower bounds for vertex deletion problems. ACM Transactions on Computation Theory 10(2):6, 2018 (original publication).

Abschlussarbeiten

• 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.

2017

Konferenzartikel

• Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, and Manuel Sorge: Assessing the Computational Complexity of Multi-Layer Subgraph Detection. In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC'17), Athens, Greece, May 2017. Volume 10236 of LNCS, pages 128–139, Springer (original publication).
• 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).
• Maximilian Katzmann and Christian Komusiewicz: Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI'17), San Francisco, Ca, USA, February 2017 (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.

Zeitschriftenartikel

• René van Bevern, Christian Komusiewicz, and Manuel Sorge: A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. Networks 70(3): 262–278, 2017 (original publication).

2016 

Konferenzartikel

• René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, and Gerhard Woeginger: Precedence-constrained scheduling problems parameterized by partial order width. In Proceedings of the 11th International Computer Science Symposium in Russia (DOOR'16), Vladivostok, September 2016. Volume 9869 of LNCS, pages 105–120, Springer (original publication).
• René van Bevern, Vincent Froese, and Christian Komusiewicz: Parameterizing edge modification problems above lower bounds. In Proceedings of the 11th International Computer Science Symposium in Russia (CSR'16), St. Petersburg, June 2016. Volume 9691 of LNCS, pages 57–72, Springer (original publication).
• 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.

Zeitschriftenartikel

• René van Bevern, Christian Komusiewicz, Rolf Niedermeier , Manuel Sorge, and Toby Walsh: H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. Artificial Intelligence 240:19–35, 2016 (original publication).
• Laurent Bulteau, Guillaume Fertin, and Christian Komusiewicz: (Prefix) Reversal Distance for (Signed) Strings with Few Blocks or Small Alphabets. Journal of Discrete Algorithms 37: 44–55, 2016 (original publication).
• Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, and Barak Navon: Parameterized Complexity of Critical Node Cuts. Theoretical Computer Science 651: 62–75, 2016 (original publication)
• Christian Komusiewicz: Multivariate Algorithmics for Finding Cohesive Subnetworks. Algorithms 9(1): 21, 2016.

2015

Konferenzartikel

• René van Bevern, Christian Komusiewicz, Rolf Niedermeier , Manuel Sorge, and Toby Walsh: H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. In Proceedings of the International Joint Conferences on Artificial Intelligence (IJCAI'15), Buenos Aires, Argentina, July 2015. Pages 808–814, AAAI Press.
• 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, André Nichterlein: Editing Graphs into Few Cliques: Complexity, Approximation, and Kernelization Schemes. In Proceedings of the Algorithms and Data Structures Symposium (WADS'15), University of Victoria, Canada, August 2015. Volume 9214 of LNCS, pages 410–421, Springer (original publication).
• 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).
• Christian Komusiewicz, André Nichterlein, and Rolf Niedermeier: Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. In Proceedings of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'15), München, Germany, June 2015. Volume 9224 of LNCS, pages 3–15, Springer (original publication).
• Christian Komusiewicz and Andreea Radulescu: On the Sound Covering Cycle Problem in Paired de Bruijn Graphs. In Proceedings of the 9th International Frontiers of Algorithmics Workshop (FAW'15), Guilin, China, July 2015. Volume 9130 of LNCS, pages 150–161, Springer (original publication).
• Christian Komusiewicz, Manuel Sorge, and Kolja Stahl: Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments. In Proceedings of the 14th International Symposium on Experimental Algorithms (SEA'15), Paris, France, June 2015. Volume 9125 of LNCS, pages 82–93, Springer (original publication).

Zeitschriftenartikel

• Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, and Ondřej Suchý: On Explaining Integer Vectors by few Homogenous Segments. Journal of Computer and System Sciences 81(4):766–782, 2015 (original publication).
• Sharon Bruckner, Falk Hüffner, and Christian Komusiewicz: A Graph Modification Approach for Finding Core–Periphery Structures in Protein Interaction Networks. Algorithms for Molecular Biology 10:16, 2015.
• Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondřej Suchý, and Mathias Weller : Polynomial-time Data Reduction for the Subset Interconnection Design Problem. SIAM Journal on Discrete Mathematics 29(1):1–25, 2015 (original publication).
• Guillaume Fertin, Shahrad Jamshidi, and Christian Komusiewicz: Towards an Algorithmic Guide to Spiral Galaxies. Theoretical Computer Science 586:26–39, 2015 (original publication).
• Guillaume Fertin, Christian Komusiewicz, Hafedh Mohamed-Babou, and Irena Rusu : Finding Supported Paths in Heterogeneous Networks. Algorithms, 8(4):810–831, 2015.
• Sepp Hartung, Christian Komusiewicz and André Nichterlein: Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. Journal of Graph Algorithms and Applications 19(1): 155–190, 2015.
• Sepp Hartung, Christian Komusiewicz, André Nichterlein, and Ondřej Suchý : On Structural Parameterizations for the 2-Club Problem. Discrete Applied Mathematics 185:79–92, 2015 (original publication).
• Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, and Martin Rötzschke: The Parameterized Complexity of the Rainbow Subgraph Problem. Algorithms 8(1):60–81, 2015.
• Christian Komusiewicz and Manuel Sorge: An Algorithmic Framework for Fixed-Cardinality Optimization in Sparse Graphs Applied to Dense Subgraph Problems. Discrete Applied Mathematics 193:145–161, 2015 (original publication).

Buchkapitel

• 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).

2014

Konferenzartikel

• Sharon Bruckner, Falk Hüffner, and Christian Komusiewicz: A Graph Modification Approach for Finding Core–Periphery Structures in Protein Interaction Networks. In Proceedings of the 14th Workshop on Algorithms in Bioinformatics (WABI'14), Wrocław, Poland, September 2014. Volume 8701 of LNCS (subseries Lecture Notes in Bioinformatics), pages 340–351, Springer (original publication).
• Laurent Bulteau, Guillaume Fertin, and Christian Komusiewicz: Reversal Distances for Strings with Few Blocks or Small Alphabets. In Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching (CPM'14), Moscow, Russia, June 2014. Volume 8486 in Lecture Notes in Computer Science, pages 50–59, Springer (original publication).
• Laurent Bulteau and Christian Komusiewicz: Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable. In Proceedings of the 25th ACM-SIAM Symposion on Discrete Algorithms (SODA'14), Portland, Oregon, January 2014. Pages 102–121, SIAM (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).

Zeitschriftenartikel

• Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, and Rolf Niedermeier: Multivariate Algorithmics for NP-hard String Problems. Bulletin of the EATCS 114:31–73, 2014 (original publication).
• Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, and Mathias Weller: On the Parameterized Complexity of Consensus Clustering. Theoretical Computer Science 542: 71–82, 2014 (original publication).
• Jiong Guo, Danny Hermelin, and Christian Komusiewicz: Local Search for String Problems: Brute-Force is Essentially Optimal. Theoretical Computer Science 525:30–41, 2014 (original publication).
• Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, and Rolf Niedermeier: Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 11(3): 455–467, 2014 (original publication).
• Christian Komusiewicz and Johannes Uhlmann: A Cubic-Vertex Kernel for Flip Consensus Tree. Algorithmica 68(1):81–108, 2014 (original publication).

2013

Konferenzartikel

• 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).
• Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, and Rolf Niedermeier: Evaluation of ILP-based Approaches for Partitioning into Colorful Components. In Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13), Rome, Italy, June 2013. Volume 7933 of LNCS, pages 176–187, Springer (original publication).
• Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, and Irena Rusu : A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. In Proceedings of the 13th Workshop on Algorithms in Bioinformatics (WABI'13), Sophia Antipolis, France, September 2013. Volume 8126 of LNCS (subseries Lecture Notes in Bioinformatics), pages 244–258, Springer (original publication).
• Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondřej Suchý, and Mathias Weller : Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. In Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC'13), Hong Kong, China, December 2013. Volume 8283 of LNCS, pages 361–371, Springer (original publication).
• Jiong Guo, Danny Hermelin, and Christian Komusiewicz: Local Search for String Problems: Brute-Force is Essentially Optimal. In Proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching (CPM'13), Bad Herrenalb, Germany, June 2013. Volume 7922 of LNCS, pages 130–141, 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).
• Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, and Rolf Niedermeier: Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. In Proceedings of the 9th International Symposium on Bioinformatics Research and Applications (ISBRA'13), Charlotte, USA, May 2013. Volume 7875 of LNCS (subseries Lecture Notes in Bioinformatics), pages 99–111, Springer (original publication).

2012

Konferenzartikel

• Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, and Johannes Uhlmann: Partitioning into Colorful Components by Minimum Edge Deletions. In Proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Helsinki, Finland, June 2012. Volume 7354 of LNCS, pages 56–69, 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).
• Sepp Hartung, Christian Komusiewicz and André Nichterlein: Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. In Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC'12), Ljubljana, Slovenia, September 2012. Volume 7535 of LNCS, pages 231–241, 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).

Zeitschriftenartikel

• Christian Komusiewicz and Johannes Uhlmann: Cluster Editing with Locally Bounded Modifications. Discrete Applied Mathematics 160(15):2259–2270, 2012 (original publication).
• Alexander Schäfer, Christian Komusiewicz, Hannes Moser, and Rolf Niedermeier: Parameterized Computational Complexity of Finding Small-Diameter Subgraphs. Optimization Letters 6(5):883–891, 2012 (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).
• Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, and Johannes Uhlmann: On Making Directed Graphs Transitive. Journal of Computer and System Sciences 78(2):559–574, 2012 (original publication).

2011

Konferenzartikel

• Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, and Mathias Weller: On the Parameterized Complexity of Consensus Clustering. In Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC'11), Yokohama, Japan, December 2011. Volume 7074 of LNCS, pages 624–633, Springer (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).

Zeitschriftenartikel

• Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, and Rolf Niedermeier: Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(5):1296–1308, 2011 (original publication).
• Nadja Betzler, Jiong Guo, Christian Komusiewicz, and Rolf Niedermeier: Average Parameterization and Partial Kernelization for Computing Medians. Journal of Computer and System Sciences 77(4):774–789, 2011 (original publication).
• Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, and Johannes Uhlmann: Graph-based data clustering with overlaps. Discrete Optimization 8(1):2–17, 2011 (original publication).
• Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, and Johannes Uhlmann: Editing Graphs into Disjoint Unions of Dense Clusters. Algorithmica 61(4):949–970, 2011 (original publication).
• Christian Komusiewicz, Rolf Niedermeier, and Johannes Uhlmann: Deconstructing Intractability – A Multivariate Complexity Analysis of Interval Constrained Coloring. Journal of Discrete Algorithms 9(1):137–151, 2011 (original publication).

Abschlussarbeiten

• Christian Komusiewicz: Parameterized Algorithmics for Network Analysis: Clustering & Querying. Dissertation, Fakultät für Elektrotechnik und Informatik, Technische Universität Berlin, September 2011.

2010

Konferenzartikel

• Nadja Betzler, Jiong Guo, Christian Komusiewicz, and Rolf Niedermeier: Average Parameterization and Partial Kernelization for Computing Medians. In Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN'10), Oaxaca, México, April 2010. Volume 6034 of LNCS, pages 60–71, 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) .
• Jiong Guo, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, and Johannes Uhlmann: Exact Algorithms and Experiments for Hierarchical Tree Clustering. In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI'10), Atlanta, GA, USA, July 2010.

Zeitschriftenartikel

• Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, and Johannes Uhlmann: A more relaxed model for graph-based data clustering: s-plex cluster editing. SIAM Journal on Discrete Mathematics 24(4): 1662–1683, 2010 (original publication).
• Falk Hüffner, Christian Komusiewicz, Hannes Moser, and Rolf Niedermeier: Fixed-parameter algorithms for cluster vertex deletion. Theory of Computing Systems 47(1):196–217, 2010 (original publication).

2009

Konferenzartikel

• 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).
• Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, and Johannes Uhlmann: Editing Graphs into Disjoint Unions of Dense Clusters. In Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC'09), Hawaii, USA, December 2009. Volume 5878 of LNCS, pages 583–593, Springer (original publication).
• Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, and Johannes Uhlmann: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. In Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM'09), San Francisco, USA, June 2009. Volume 5564 of LNCS, pages 226–239, Springer (original publication).
• Christian Komusiewicz, Rolf Niedermeier, and Johannes Uhlmann: Deconstructing Intractability – A Case Study for Interval Constrained Coloring. In Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM'09), Lille, France, June 2009. Volume 5577 of LNCS, pages 207–220, 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).

Zeitschriftenartikel

• Falk Hüffner, Christian Komusiewicz, Hannes Moser, and Rolf Niedermeier: Isolation concepts for clique enumeration: comparison and computational experiments. Theoretical Computer Science, 410(52):5384–5397, 2009 (original publication).
• Christian Komusiewicz, Falk Hüffner, Hannes Moser, and Rolf Niedermeier: Isolation concepts for efficiently enumerating dense subgraphs. Theoretical Computer Science, 410(38–40):3640–3654, 2009 (original publication).

2008

Konferenzartikel

• Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, and Rolf Niedermeier: Parameterized algorithms and hardness results for some graph motif problems. In Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM'08), Pisa, Italy. June 2008. Volume 5029 of LNCS, pages 31–43. 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).
• Falk Hüffner, Christian Komusiewicz, Hannes Moser, and Rolf Niedermeier: Fixed-parameter algorithms for cluster vertex deletion. In Proceedings of the 8th Latin American Theoretical Informatics Symposium (LATIN'08), Búzios, Brazil. April 2008. Volume 4957 of LNCS, pages 711–722, 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.

2007

Konferenzartikel

• Christian Komusiewicz, Falk Hüffner, Hannes Moser, and Rolf Niedermeier: Isolation concepts for enumerating dense subgraphs. In Proceedings of the 13th International Computing and Combinatorics Conference (COCOON'07), Banff, Canada. July 2007. Volume 4598 of LNCS, pages 140–150, Springer (original publication).

Abschlussarbeiten

• Christian Komusiewicz: Various Isolation Concepts for the Enumeration of Dense Subgraphs. Diplomarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, März 2007.