The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Christian Komusiewicz" ( http://dblp.L3S.de/Authors/Christian_Komusiewicz )

  Author page on DBLP  Author page in RDF  Community of Christian Komusiewicz in ASPL-2

Publication years (Num. hits)
2007-2010 (19) 2011-2012 (17) 2013-2014 (21) 2015 (23) 2016 (16) 2017-2018 (23) 2019 (6)
Publication types (Num. hits)
article(61) incollection(1) inproceedings(62) phdthesis(1)
Venues (Conferences, Journals, ...)
CoRR(22) CPM(9) IPEC(6) Theor. Comput. Sci.(6) J. Comput. Syst. Sci.(4) SOFSEM(4) WADS(4) WG(4) Algorithmica(3) Algorithms(3) Discrete Applied Mathematics(3) ISAAC(3) AAAI(2) CIAC(2) COCOON(2) FUN(2) More (+10 of total 54)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 126 publication records. Showing 125 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon When Can Graph Hyperbolicity be Computed in Linear Time? Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer Destroying Bicolored P3s by Deleting Few Edges. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Christian Komusiewicz, Frank Sommer Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. Search on Bibsonomy SOFSEM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer Destroying Bicolored P3s by Deleting Few Edges. Search on Bibsonomy CiE The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. Search on Bibsonomy CIAC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1René van Bevern, Vincent Froese, Christian Komusiewicz Parameterizing Edge Modification Problems Above Lower Bounds. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Niels Grüttemeier, Christian Komusiewicz On the Relation of Strong Triadic Closure and Cluster Deletion. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Guillaume Fertin, Falk Hüffner, Christian Komusiewicz, Manuel Sorge Matching algorithms for assigning orthologs after genome duplication events. Search on Bibsonomy Computational Biology and Chemistry The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz Tight Running Time Lower Bounds for Vertex Deletion Problems. Search on Bibsonomy TOCT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Guillaume Fertin, Julien Fradin, Christian Komusiewicz On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. Search on Bibsonomy CPM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Niels Grüttemeier, Christian Komusiewicz On the Relation of Strong Triadic Closure and Cluster Deletion. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Frank Sommer, Christian Komusiewicz Parameterized Algorithms for Module Map Problems. Search on Bibsonomy ISCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Dieter Kratsch, Van Bang Le Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms. Search on Bibsonomy IPEC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. Search on Bibsonomy ESA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon When can Graph Hyperbolicity be computed in Linear Time? Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Guillaume Fertin, Julien Fradin, Christian Komusiewicz The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Manuel Sorge A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. Search on Bibsonomy Networks The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. Search on Bibsonomy CPM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz Beyond Adjacency Maximization: Scaffold Filling for New String Distances. Search on Bibsonomy CPM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon When Can Graph Hyperbolicity Be Computed in Linear Time? Search on Bibsonomy WADS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Maximilian Katzmann, Christian Komusiewicz Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem. Search on Bibsonomy AAAI The full citation details ... 2017 DBLP  BibTeX  RDF
1Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. Search on Bibsonomy IPEC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Assessing the Computational Complexity of Multi-layer Subgraph Detection. Search on Bibsonomy CIAC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh H-index manipulation by merging articles: Models, theory, and experiments. Search on Bibsonomy Artif. Intell. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz Multivariate Algorithmics for Finding Cohesive Subnetworks. Search on Bibsonomy Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh h-Index Manipulation by Undoing Merges. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger Precedence-constrained scheduling problems parameterized by partial order width. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Christian Komusiewicz, André Nichterlein, Rolf Niedermeier Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge Assessing the Computational Complexity of Multi-Layer Subgraph Detection. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz (Prefix) reversal distance for (signed) strings with few blocks or small alphabets. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon Parameterized complexity of critical node cuts. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz Kernelization, Partially Polynomial Kernels. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Vincent Froese, Christian Komusiewicz Parameterizing Edge Modification Problems Above Lower Bounds. Search on Bibsonomy CSR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Guillaume Fertin, Christian Komusiewicz Graph Motif Problems Parameterized by Dual. Search on Bibsonomy CPM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. Search on Bibsonomy DOOR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge Twins in Subdivision Drawings of Hypergraphs. Search on Bibsonomy Graph Drawing The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond The First Parameterized Algorithms and Computational Experiments Challenge. Search on Bibsonomy IPEC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. Search on Bibsonomy SWAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh h-Index Manipulation by Undoing Merges. Search on Bibsonomy ECAI The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Guillaume Fertin, Christian Komusiewicz, Hafedh Mohamed-Babou, Irena Rusu Finding Supported Paths in Heterogeneous Networks. Search on Bibsonomy Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke The Parameterized Complexity of the Rainbow Subgraph Problem. Search on Bibsonomy Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý On explaining integer vectors by few homogeneous segments. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Sharon Bruckner, Falk Hüffner, Christian Komusiewicz A graph modification approach for finding core-periphery structures in protein interaction networks. Search on Bibsonomy Algorithms for Molecular Biology The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý On structural parameterizations for the 2-club problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Manuel Sorge An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1René van Bevern, Vincent Froese, Christian Komusiewicz Parameterizing edge modification problems above lower bounds. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge Twins in Subdivision Drawings of Hypergraphs. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon Parameterized Complexity of Critical Node Cuts. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Manuel Sorge Approximation algorithms for mixed, windy, and capacitated arc routing problems. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Christian Komusiewicz Tight Running Time Lower Bounds for Vertex Deletion Problems. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Sepp Hartung, Christian Komusiewicz, André Nichterlein Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz Towards an algorithmic guide to Spiral Galaxies. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Falk Hüffner, Christian Komusiewicz, Manuel Sorge Finding Highly Connected Subgraphs. Search on Bibsonomy SOFSEM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Manuel Sorge, Kolja Stahl Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments. Search on Bibsonomy SEA The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, André Nichterlein, Rolf Niedermeier Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Andreea Radulescu On the Sound Covering Cycle Problem in Paired de Bruijn Graphs. Search on Bibsonomy FAW The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Falk Hüffner, Christian Komusiewicz, André Nichterlein Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes. Search on Bibsonomy WADS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Manuel Sorge Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. Search on Bibsonomy ATMOS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon Parameterized Complexity of Critical Node Cuts. Search on Bibsonomy IPEC The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. Search on Bibsonomy IJCAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Christian Komusiewicz, Johannes Uhlmann A Cubic-Vertex Kernel for Flip Consensus Tree. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier Multivariate Algorithmics for NP-Hard String Problems. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2014 DBLP  BibTeX  RDF
1René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh On Google Scholar H-Index Manipulation by Merging Articles. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, Rolf Niedermeier Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. Search on Bibsonomy IEEE/ACM Trans. Comput. Biology Bioinform. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller On the parameterized complexity of consensus clustering. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Danny Hermelin, Christian Komusiewicz Local search for string problems: Brute-force is essentially optimal. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sharon Bruckner, Falk Hüffner, Christian Komusiewicz A Graph Modification Approach for Finding Core-Periphery Structures in Protein Interaction Networks. Search on Bibsonomy WABI The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz Reversal Distances for Strings with Few Blocks or Small Alphabets. Search on Bibsonomy CPM The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke The Parameterized Complexity of the Rainbow Subgraph Problem. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Christian Komusiewicz Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable. Search on Bibsonomy SODA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz Towards an Algorithmic Guide to Spiral Galaxies. Search on Bibsonomy FUN The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Christian Komusiewicz Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý On Structural Parameterizations for the 2-Club Problem Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Sepp Hartung, Christian Komusiewicz, André Nichterlein On Structural Parameterizations for the 2-Club Problem. Search on Bibsonomy SOFSEM The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Falk Hüffner, Christian Komusiewicz, Adrian Liebtrau, Rolf Niedermeier Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. Search on Bibsonomy ISBRA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. Search on Bibsonomy ISAAC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier Evaluation of ILP-Based Approaches for Partitioning into Colorful Components. Search on Bibsonomy SEA The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. Search on Bibsonomy WABI The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Danny Hermelin, Christian Komusiewicz Local Search for String Problems: Brute Force Is Essentially Optimal. Search on Bibsonomy CPM The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý On Explaining Integer Vectors by Few Homogenous Segments. Search on Bibsonomy WADS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Christoph Schmidt, Thomas Weiss 0001, Christian Komusiewicz, Herbert Witte, Lutz Leistritz An Analytical Approach to Network Motif Detection in Samples of Networks with Pairwise Different Vertex Labels. Search on Bibsonomy Comp. Math. Methods in Medicine The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann On making directed graphs transitive. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Alexander Schäfer, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier Parameterized computational complexity of finding small-diameter subgraphs. Search on Bibsonomy Optimization Letters The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Johannes Uhlmann Cluster editing with locally bounded modifications. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann Partitioning into Colorful Components by Minimum Edge Deletions. Search on Bibsonomy CPM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sepp Hartung, Christian Komusiewicz, André Nichterlein Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. Search on Bibsonomy IPEC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Manuel Sorge Finding Dense Subgraphs of Sparse Graphs. Search on Bibsonomy IPEC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christian Komusiewicz, Rolf Niedermeier New Races in Parameterized Algorithmics. Search on Bibsonomy MFCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Leo Brueggeman, Michael R. Fellows, Rudolf Fleischer, Martin Lackner, Christian Komusiewicz, Yiannis Koutis, Andreas Pfandler, Frances A. Rosamond Train Marshalling Is Fixed Parameter Tractable. Search on Bibsonomy FUN The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann Editing Graphs into Disjoint Unions of Dense Clusters. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier Average parameterization and partial kernelization for computing medians. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 125 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license