Christian Komusiewicz

photo of Christian Komusiewicz

Dr., Researcher

Algorithmik und Komplexitätstheorie
Institut für Softwaretechnik und Theoretische Informatik
Technische Universität Berlin
Sekr. TEL 5-1
Ernst Reuter Platz 7
D-10587 Berlin

E-mail:

My research interests include

My current position is funded by TU Berlin.

Previously, I have received funding from the Carl-Zeiss-Stiftung, the DFG, and from the Région Pays de la Loire.

Publications

BibTeX bibliography data of the publications.
2014
Conference articles
Journal articles
2013
Conference articles
2012
Conference articles
Journal articles
2011
Conference articles
Journal articles
Thesis
2010
Conference articles
Journal articles
2009
Conference articles
  • 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). [show abstract]
  • 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 in Lecture Notes in Computer Science, pages 516–526, Springer. [show abstract]
  • 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. [show abstract]
  • 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 in Lecture Notes in Computer Science, pages 226–239, Springer. [show abstract]
  • 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 in Lecture Notes in Computer Science, pages 207–220, Springer. [show abstract]
  • 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 in Lecture Notes in Computer Science, pages 542–553. Springer (original publication). [show abstract]
Journal articles
  • 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). [show abstract]
  • 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). [show abstract]
2008
Conference articles
  • 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 in Lecture Notes in Computer Science, pages 31–43. Springer (original publication). [show abstract]
  • 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 in Lecture Notes in Computer Science, pages 451–462, Springer (original publication). [show abstract]
  • 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 in Lecture Notes in Computer Science, pages 405–416, Springer (original publication). [show abstract]
  • 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 Lecture Notes in Computer Science, pages 711–722, Springer (original publication). Journal version available. [show abstract]
  • 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(original publication). [show abstract]
2007
Conference articles
  • 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 in Lecture Notes in Computer Science, pages 140–150, Springer (original publication). [show abstract]
Thesis
  • Christian Komusiewicz:
    Various Isolation Concepts for the Enumeration of Dense Subgraphs.
    Diplomarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, March 2007. [show abstract]

Valid HTML 4.01!
Last modified: Mon Apr 29 11:03:56 CET 2013