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