default search action
Christian Komusiewicz
Person information
- affiliation: Friedrich-Schiller-Universität Jena, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j64]Niels Grüttemeier
, Philipp Heinrich Keßler, Christian Komusiewicz
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs. J. Comb. Optim. 48(3): 16 (2024) - [j63]Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
On Critical Node Problems with Vulnerable Vertices. J. Graph Algorithms Appl. 28(1): 1-26 (2024) - [j62]René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
The role of twins in computing planar supports of hypergraphs. J. Graph Algorithms Appl. 28(1): 51-79 (2024) - [c96]Jaroslav Garvardt
Protective and Nonprotective Subset Sum Games: A Parameterized Complexity Analysis. ADT 2024: 82-97 - [c95]Henning Martin Woydt, Christian Komusiewicz, Frank Sommer:
SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints. ESA 2024: 102:1-102:18 - [c94]Christian Komusiewicz, Jannik Schestag:
Maximizing Phylogenetic Diversity Under Ecological Constraints: A Parameterized Complexity Study. FSTTCS 2024: 28:1-28:18 - [c93]Jaroslav Garvardt, Christian Komusiewicz, Nils Morawietz:
When Can Cluster Deletion with Bounded Weights Be Solved Efficiently? ISAAC 2024: 32:1-32:17 - [c92]Jaroslav Garvardt, Christian Komusiewicz:
Modularity Clustering Parameterized by Max Leaf Number. IPEC 2024: 16:1-16:14 - [c91]Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
On the Complexity of Community-Aware Network Sparsification. MFCS 2024: 60:1-60:18 - [i44]Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
On the Complexity of Community-aware Network Sparsification. CoRR abs/2402.15494 (2024) - [i43]Christian Komusiewicz, Jannik Schestag:
Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study. CoRR abs/2405.17314 (2024) - [i42]Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
Parameterized Local Search for Max c-Cut. CoRR abs/2409.13380 (2024) - 2023
- [j61]Tomohiro Koana
Essentially Tight Kernels for (Weakly) Closed Graphs. Algorithmica 85(6): 1706-1735 (2023) - [j60]Tomohiro Koana
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. Algorithmica 85(7): 2156-2187 (2023) - [j59]Jana Holznigenkemper
On computing exact means of time series using the move-split-merge metric. Data Min. Knowl. Discov. 37(2): 595-626 (2023) - [j58]Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. Discret. Math. Theor. Comput. Sci. 25 (2023) - [j57]Jaroslav Garvardt
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. Theory Comput. Syst. 67(5): 1050-1081 (2023) - [c90]Luca Pascal Staus
Exact Algorithms for Group Closeness Centrality. ACDA 2023: 1-12 - [c89]Christian Komusiewicz, Jannis Schramek, Frank Sommer:
On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics. ACDA 2023: 13-24 - [c88]Christian Komusiewicz, Simone Linz
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. CPM 2023: 18:1-18:18 - [c87]Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge:
On Computing Optimal Tree Ensembles. ICML 2023: 17364-17374 - [c86]Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Parameterized Local Search for Max c-Cut. IJCAI 2023: 5586-5594 - [c85]Jana Holznigenkemper, Christian Komusiewicz, Nils Morawietz
On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric. MFCS 2023: 54:1-54:15 - [c84]Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger:
Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation. SDM 2023: 451-459 - [c83]Alexander Bille, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
A Graph-Theoretic Formulation of Exploratory Blockmodeling. SEA 2023: 14:1-14:20 - [i41]Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger:
Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation. CoRR abs/2301.01977 (2023) - [i40]Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge:
On Computing Optimal Tree Ensembles. CoRR abs/2306.04423 (2023) - [i39]Christian Komusiewicz, Jannik Schestag:
A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem. CoRR abs/2307.03518 (2023) - 2022
- [j56]Niels Grüttemeier, Christian Komusiewicz
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. J. Artif. Intell. Res. 74: 1225-1267 (2022) - [j55]Petr A. Golovach
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. 123: 76-102 (2022) - [j54]Nils Morawietz
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. Theory Comput. Syst. 66(5): 1019-1045 (2022) - [j53]Tomohiro Koana, Christian Komusiewicz, Frank Sommer
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems. SIAM J. Discret. Math. 36(4): 2798-2821 (2022) - [j52]Nils Morawietz
Colored cut games. Theor. Comput. Sci. 936: 13-32 (2022) - [c82]Jaroslav Garvardt, Christian Komusiewicz
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. IWOCA 2022: 313-326 - [c81]Jannik Schestag, Niels Grüttemeier
On Critical Node Problems with Vulnerable Vertices. IWOCA 2022: 494-508 - [c80]Christian Komusiewicz, Nils Morawietz
Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial. IPEC 2022: 20:1-20:18 - [c79]Christian Komusiewicz
Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. MFCS 2022: 66:1-66:14 - [c78]Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer:
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS 2022: 42:1-42:18 - [i38]Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer:
Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR abs/2201.05465 (2022) - [i37]Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer:
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. CoRR abs/2201.05654 (2022) - [i36]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. CoRR abs/2204.02902 (2022) - [i35]Jana Holznigenkemper, Christian Komusiewicz, Bernhard Seeger:
On Computing Exact Means of Time Series Using the Move-Split-Merge Metric. CoRR abs/2209.14197 (2022) - [i34]Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer:
Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs. CoRR abs/2211.01701 (2022) - 2021
- [j51]Laurent Bulteau
Sorting by Multi-Cut Rearrangements. Algorithms 14(6): 169 (2021) - [j50]Christian Komusiewicz
Enumerating connected induced subgraphs: Improved delay and experimental comparison. Discret. Appl. Math. 303: 262-282 (2021) - [j49]Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer:
Destroying Bicolored P3s by Deleting Few Edges. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j48]Laurent Bulteau
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors. J. Comput. Syst. Sci. 120: 75-96 (2021) - [c77]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. AAAI 2021: 12328-12335 - [c76]Christian Komusiewicz
Can Local Optimality Be Used for Efficient Data Reduction? CIAC 2021: 354-366 - [c75]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz
On the Parameterized Complexity of Polytree Learning. IJCAI 2021: 4221-4227 - [c74]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Essentially Tight Kernels For (Weakly) Closed Graphs. ISAAC 2021: 35:1-35:15 - [c73]Laurent Bulteau, Guillaume Fertin
Sorting by Multi-cut Rearrangements. SOFSEM 2021: 593-607 - [c72]Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. STACS 2021: 37:1-37:18 - [c71]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
Preventing Small (s,t)Cuts by Protecting Edges. WG 2021: 143-155 - [i33]Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. CoRR abs/2101.03800 (2021) - [i32]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Essentially Tight Kernels for (Weakly) Closed Graphs. CoRR abs/2103.03914 (2021) - [i31]Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. CoRR abs/2104.03138 (2021) - [i30]Laurent Bulteau, Michael R. Fellows, Christian Komusiewicz, Frances A. Rosamond:
Parameterized String Equations. CoRR abs/2104.14171 (2021) - [i29]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
On the Parameterized Complexity of Polytree Learning. CoRR abs/2105.09675 (2021) - [i28]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
Preventing Small (s, t)-Cuts by Protecting Edges. CoRR abs/2107.04482 (2021) - 2020
- [j47]Niels Grüttemeier
On the Relation of Strong Triadic Closure and Cluster Deletion. Algorithmica 82(4): 853-880 (2020) - [j46]Christian Komusiewicz
Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms. Discret. Appl. Math. 283: 44-58 (2020) - [j45]Frank Sommer, Christian Komusiewicz
Parameterized algorithms for Module Map problems. Discret. Appl. Math. 283: 396-416 (2020) - [j44]Guillaume Fertin
Graph Motif Problems Parameterized by Dual. J. Graph Algorithms Appl. 24(3): 371-396 (2020) - [j43]René van Bevern
h-Index manipulation by undoing merges. Quant. Sci. Stud. 1(4): 1529-1552 (2020) - [j42]Iyad Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. SIAM J. Discret. Math. 34(1): 640-681 (2020) - [j41]Christian Komusiewicz, Mateus de Oliveira Oliveira
Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping. Theor. Comput. Sci. 847: 27-38 (2020) - [c70]Christian Komusiewicz, Frank Sommer:
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. ALENEX 2020: 12-26 - [c69]Niels Grüttemeier
String Factorizations Under Various Collision Constraints. CPM 2020: 17:1-17:14 - [c68]Tomohiro Koana
Exploiting c-Closure in Kernelization Algorithms for Graph Problems. ESA 2020: 65:1-65:17 - [c67]Nils Morawietz
Colored Cut Games. FSTTCS 2020: 30:1-30:17 - [c66]Niels Grüttemeier, Christian Komusiewicz:
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. IJCAI 2020: 4245-4251 - [c65]Tomohiro Koana
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. ISAAC 2020: 20:1-20:17 - [c64]Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. SOFSEM 2020: 248-259 - [c63]Niels Grüttemeier
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. SWAT 2020: 26:1-26:17 - [i27]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. CoRR abs/2002.08659 (2020) - [i26]Niels Grüttemeier, Christian Komusiewicz:
Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. CoRR abs/2004.14724 (2020) - [i25]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems. CoRR abs/2005.03986 (2020) - [i24]Tomohiro Koana, Christian Komusiewicz, Frank Sommer:
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. CoRR abs/2007.05630 (2020)
2010 – 2019
- 2019
- [j40]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When Can Graph Hyperbolicity be Computed in Linear Time? Algorithmica 81(5): 2016-2045 (2019) - [j39]Christian Komusiewicz, André Nichterlein
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments. Eur. J. Oper. Res. 275(3): 846-864 (2019) - [j38]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the computational complexity of multilayer subgraph detection. Netw. Sci. 7(2): 215-241 (2019) - [c62]Laurent Bulteau
Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. CIAC 2019: 99-111 - [c61]Niels Grüttemeier, Christian Komusiewicz
Destroying Bicolored P3s by Deleting Few Edges. CiE 2019: 193-204 - [c60]Christian Komusiewicz
Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison. SOFSEM 2019: 272-284 - [i23]Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer:
Destroying Bicolored P3s by Deleting Few Edges. CoRR abs/1901.03627 (2019) - [i22]Guillaume Fertin, Christian Komusiewicz:
Graph Motif Problems Parameterized by Dual. CoRR abs/1908.03870 (2019) - 2018
- [j37]Guillaume Fertin
Matching algorithms for assigning orthologs after genome duplication events. Comput. Biol. Chem. 74: 379-390 (2018) - [j36]Iyad A. Kanj, Christian Komusiewicz
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. J. Comput. Syst. Sci. 92: 22-47 (2018) - [j35]René van Bevern
Parameterizing Edge Modification Problems Above Lower Bounds. Theory Comput. Syst. 62(3): 739-770 (2018) - [j34]Christian Komusiewicz:
Tight Running Time Lower Bounds for Vertex Deletion Problems. ACM Trans. Comput. Theory 10(2): 6:1-6:18 (2018) - [c59]Guillaume Fertin, Julien Fradin, Christian Komusiewicz:
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. CPM 2018: 17:1-17:15 - [c58]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. ESA 2018: 51:1-51:14 - [c57]Frank Sommer
Parameterized Algorithms for Module Map Problems. ISCO 2018: 376-388 - [c56]Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms. IPEC 2018: 19:1-19:13 - [c55]Niels Grüttemeier, Christian Komusiewicz:
On the Relation of Strong Triadic Closure and Cluster Deletion. WG 2018: 239-251 - [i21]Niels Grüttemeier, Christian Komusiewicz:
On the Relation of Strong Triadic Closure and Cluster Deletion. CoRR abs/1803.00807 (2018) - [i20]Christian Komusiewicz, André Nichterlein, Rolf Niedermeier, Marten Picker:
Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments. CoRR abs/1807.07516 (2018) - [i19]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. CoRR abs/1808.08772 (2018) - [i18]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 abs/1811.09411 (2018) - 2017
- [j33]René van Bevern
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments. Networks 70(3): 262-278 (2017) - [c54]Maximilian Katzmann, Christian Komusiewicz:
Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem. AAAI 2017: 846-852 - [c53]Robert Bredereck
Assessing the Computational Complexity of Multi-layer Subgraph Detection. CIAC 2017: 128-139 - [c52]Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi
Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping. CPM 2017: 11:1-11:17 - [c51]Laurent Bulteau
Beyond Adjacency Maximization: Scaffold Filling for New String Distances. CPM 2017: 27:1-27:17 - [c50]Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller:
The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. IPEC 2017: 30:1-30:12 - [c49]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon
When Can Graph Hyperbolicity Be Computed in Linear Time? WADS 2017: 397-408 - [i17]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. CoRR abs/1702.04322 (2017) - [i16]Till Fluschnik, Christian Komusiewicz, George B. Mertzios, André Nichterlein, Rolf Niedermeier, Nimrod Talmon:
When can Graph Hyperbolicity be computed in Linear Time? CoRR abs/1702.06503 (2017) - [i15]Guillaume Fertin, Julien Fradin, Christian Komusiewicz:
The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph. CoRR abs/1710.07584 (2017) - 2016
- [j32]René van Bevern
H-index manipulation by merging articles: Models, theory, and experiments. Artif. Intell. 240: 19-35 (2016) - [j31]Christian Komusiewicz
Multivariate Algorithmics for Finding Cohesive Subnetworks. Algorithms 9(1): 21 (2016) - [j30]Laurent Bulteau
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets. J. Discrete Algorithms 37: 44-55 (2016) - [j29]Danny Hermelin
Parameterized complexity of critical node cuts. Theor. Comput. Sci. 651: 62-75 (2016) - [c48]Guillaume Fertin, Christian Komusiewicz:
Graph Motif Problems Parameterized by Dual. CPM 2016: 7:1-7:12 - [c47]René van Bevern, Vincent Froese, Christian Komusiewicz:
Parameterizing Edge Modification Problems Above Lower Bounds. CSR 2016: 57-72 - [c46]René van Bevern, Robert Bredereck
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. DOOR 2016: 105-120 - [c45]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index Manipulation by Undoing Merges. ECAI 2016: 895-903 - [c44]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. GD 2016: 67-80 - [c43]Holger Dell
The First Parameterized Algorithms and Computational Experiments Challenge. IPEC 2016: 30:1-30:9 - [c42]Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen:
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs. SWAT 2016: 14:1-14:14 - [r1]Christian Komusiewicz:
Kernelization, Partially Polynomial Kernels. Encyclopedia of Algorithms 2016: 1028-1031 - [i14]René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
h-Index Manipulation by Undoing Merges. CoRR abs/1604.04827 (2016) - [i13]Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
Assessing the Computational Complexity of Multi-Layer Subgraph Detection. CoRR abs/1604.07724 (2016) - [i12]René van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger:
Precedence-constrained scheduling problems parameterized by partial order width. CoRR abs/1605.00901 (2016) - [i11]Christian Komusiewicz, André Nichterlein, Rolf Niedermeier:
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. CoRR abs/1606.03268 (2016) - 2015
- [j28]Falk Hüffner
The Parameterized Complexity of the Rainbow Subgraph Problem. Algorithms 8(1): 60-81 (2015) - [j27]Guillaume Fertin
Finding Supported Paths in Heterogeneous Networks. Algorithms 8(4): 810-831 (2015) - [j26]Sharon Bruckner, Falk Hüffner
A graph modification approach for finding core-periphery structures in protein interaction networks. Algorithms Mol. Biol. 10: 16 (2015) - [j25]Sepp Hartung, Christian Komusiewicz
On structural parameterizations for the 2-club problem. Discret. Appl. Math. 185: 79-92 (2015) - [j24]Christian Komusiewicz, Manuel Sorge:
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. Discret. Appl. Math. 193: 145-161 (2015) - [j23]Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý
On explaining integer vectors by few homogeneous segments. J. Comput. Syst. Sci. 81(4): 766-782 (2015) - [j22]Sepp Hartung, Christian Komusiewicz, André Nichterlein:
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. J. Graph Algorithms Appl. 19(1): 155-190 (2015) - [j21]Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. SIAM J. Discret. Math. 29(1): 1-25 (2015) - [j20]Guillaume Fertin
Towards an algorithmic guide to Spiral Galaxies. Theor. Comput. Sci. 586: 26-39 (2015) - [c41]René van Bevern, Christian Komusiewicz, Manuel Sorge:
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems. ATMOS 2015: 130-143 - [c40]Christian Komusiewicz, Andreea Radulescu:
On the Sound Covering Cycle Problem in Paired de Bruijn Graphs. FAW 2015: 150-161 - [c39]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
H-Index Manipulation by Merging Articles: Models, Theory, and Experiments. IJCAI 2015: 808-814 - [c38]Danny Hermelin
Parameterized Complexity of Critical Node Cuts. IPEC 2015: 343-354 - [c37]Falk Hüffner
Finding Highly Connected Subgraphs. SOFSEM 2015: 254-265 - [c36]Falk Hüffner
Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes. WADS 2015: 410-421 - [c35]Christian Komusiewicz, Manuel Sorge, Kolja Stahl:
Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments. SEA 2015: 82-93 - [c34]Christian Komusiewicz, André Nichterlein, Rolf Niedermeier:
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics. WG 2015: 3-15 - [i10]Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon:
Parameterized Complexity of Critical Node Cuts. CoRR abs/1503.06321 (2015) - [i9]René van Bevern, Christian Komusiewicz, Manuel Sorge:
Approximation algorithms for mixed, windy, and capacitated arc routing problems. CoRR abs/1506.05620 (2015) - [i8]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Well-Formed Separator Sequences, with an Application to Hypergraph Drawing. CoRR abs/1507.02350 (2015) - [i7]Christian Komusiewicz:
Tight Running Time Lower Bounds for Vertex Deletion Problems. CoRR abs/1511.05449 (2015) - [i6]René van Bevern, Iyad A. Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge:
Twins in Subdivision Drawings of Hypergraphs. CoRR abs/1511.09389 (2015) - [i5]René van Bevern, Vincent Froese, Christian Komusiewicz:
Parameterizing edge modification problems above lower bounds. CoRR abs/1512.04047 (2015) - 2014
- [j19]Christian Komusiewicz
A Cubic-Vertex Kernel for Flip Consensus Tree. Algorithmica 68(1): 81-108 (2014) - [j18]Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier:
Multivariate Algorithmics for NP-Hard String Problems. Bull. EATCS 114 (2014) - [j17]Falk Hüffner
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. IEEE ACM Trans. Comput. Biol. Bioinform. 11(3): 455-467 (2014) - [j16]Jiong Guo, Danny Hermelin
Local search for string problems: Brute-force is essentially optimal. Theor. Comput. Sci. 525: 30-41 (2014) - [j15]Martin Dörnfelder, Jiong Guo, Christian Komusiewicz
On the parameterized complexity of consensus clustering. Theor. Comput. Sci. 542: 71-82 (2014) - [c33]Laurent Bulteau
Reversal Distances for Strings with Few Blocks or Small Alphabets. CPM 2014: 50-59 - [c32]Guillaume Fertin
Towards an Algorithmic Guide to Spiral Galaxies. FUN 2014: 171-182 - [c31]Laurent Bulteau
Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable. SODA 2014: 102-121 - [c30]Sharon Bruckner, Falk Hüffner
A Graph Modification Approach for Finding Core-Periphery Structures in Protein Interaction Networks. WABI 2014: 340-351 - [c29]Falk Hüffner
The Parameterized Complexity of the Rainbow Subgraph Problem. WG 2014: 287-298 - [i4]René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh:
On Google Scholar H-Index Manipulation by Merging Articles. CoRR abs/1412.5498 (2014) - 2013
- [c28]Jiong Guo, Danny Hermelin
Local Search for String Problems: Brute Force Is Essentially Optimal. CPM 2013: 130-141 - [c27]Jiehua Chen, Christian Komusiewicz
Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. ISAAC 2013: 361-371 - [c26]Falk Hüffner
Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage. ISBRA 2013: 99-111 - [c25]Sepp Hartung, Christian Komusiewicz
On Structural Parameterizations for the 2-Club Problem. SOFSEM 2013: 233-243 - [c24]Laurent Bulteau
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. WABI 2013: 244-258 - [c23]Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz
On Explaining Integer Vectors by Few Homogenous Segments. WADS 2013: 207-218 - [c22]Sharon Bruckner, Falk Hüffner
Evaluation of ILP-Based Approaches for Partitioning into Colorful Components. SEA 2013: 176-187 - [i3]Laurent Bulteau
Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable. CoRR abs/1305.0649 (2013) - [i2]Sepp Hartung, Christian Komusiewicz, André Nichterlein, Ondrej Suchý:
On Structural Parameterizations for the 2-Club Problem. CoRR abs/1305.3735 (2013) - [i1]Laurent Bulteau
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. CoRR abs/1307.7842 (2013) - 2012
- [j14]Christoph Schmidt
An Analytical Approach to Network Motif Detection in Samples of Networks with Pairwise Different Vertex Labels. Comput. Math. Methods Medicine 2012: 910380:1-910380:12 (2012) - [j13]Christian Komusiewicz
Cluster editing with locally bounded modifications. Discret. Appl. Math. 160(15): 2259-2270 (2012) - [j12]Mathias Weller, Christian Komusiewicz
On making directed graphs transitive. J. Comput. Syst. Sci. 78(2): 559-574 (2012) - [j11]Alexander Schäfer, Christian Komusiewicz
Parameterized computational complexity of finding small-diameter subgraphs. Optim. Lett. 6(5): 883-891 (2012) - [c21]Sharon Bruckner, Falk Hüffner
Partitioning into Colorful Components by Minimum Edge Deletions. CPM 2012: 56-69 - [c20]Leo Brueggeman
Train Marshalling Is Fixed Parameter Tractable. FUN 2012: 51-56 - [c19]Sepp Hartung, Christian Komusiewicz
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs. IPEC 2012: 231-241 - [c18]Christian Komusiewicz
Finding Dense Subgraphs of Sparse Graphs. IPEC 2012: 242-251 - [c17]Christian Komusiewicz
New Races in Parameterized Algorithmics. MFCS 2012: 19-30 - 2011
- [b1]Christian Komusiewicz:
Parameterized Algorithmics for Network Analysis: Clustering & Querying. Berlin Institute of Technology, 2011, ISBN 978-3-7983-2379-7, pp. 1-174 - [j10]Jiong Guo, Iyad A. Kanj, Christian Komusiewicz
Editing Graphs into Disjoint Unions of Dense Clusters. Algorithmica 61(4): 949-970 (2011) - [j9]Michael R. Fellows
Graph-based data clustering with overlaps. Discret. Optim. 8(1): 2-17 (2011) - [j8]Nadja Betzler, Jiong Guo, Christian Komusiewicz
Average parameterization and partial kernelization for computing medians. J. Comput. Syst. Sci. 77(4): 774-789 (2011) - [j7]Christian Komusiewicz
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring. J. Discrete Algorithms 9(1): 137-151 (2011) - [j6]Nadja Betzler, René van Bevern, Michael R. Fellows
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 8(5): 1296-1308 (2011) - [c16]Martin Dörnfelder, Jiong Guo, Christian Komusiewicz
On the Parameterized Complexity of Consensus Clustering. ISAAC 2011: 624-633 - [c15]Christian Komusiewicz
Alternative Parameterizations for Cluster Editing. SOFSEM 2011: 344-355 - 2010
- [j5]Falk Hüffner
Fixed-Parameter Algorithms for Cluster Vertex Deletion. Theory Comput. Syst. 47(1): 196-217 (2010) - [j4]Jiong Guo, Christian Komusiewicz
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing. SIAM J. Discret. Math. 24(4): 1662-1683 (2010) - [c14]Sepp Hartung, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann:
Exact Algorithms and Experiments for Hierarchical Tree Clustering. AAAI 2010: 457-462 - [c13]Nadja Betzler, Jiong Guo, Christian Komusiewicz
Average Parameterization and Partial Kernelization for Computing Medians. LATIN 2010: 60-71 - [c12]René van Bevern, Christian Komusiewicz
Measuring Indifference: Unit Interval Vertex Deletion. WG 2010: 232-243
2000 – 2009
- 2009
- [j3]Daniel Brügmann, Christian Komusiewicz
On Generating Triangle-Free Graphs. Electron. Notes Discret. Math. 32: 51-58 (2009) - [j2]Christian Komusiewicz
Isolation concepts for efficiently enumerating dense subgraphs. Theor. Comput. Sci. 410(38-40): 3640-3654 (2009) - [j1]Falk Hüffner
Isolation concepts for clique enumeration: Comparison and computational experiments. Theor. Comput. Sci. 410(52): 5384-5397 (2009) - [c11]Jiong Guo, Christian Komusiewicz
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing. AAIM 2009: 226-239 - [c10]Michael R. Fellows
Graph-Based Data Clustering with Overlaps. COCOON 2009: 516-526 - [c9]Christian Komusiewicz
Deconstructing Intractability: A Case Study for Interval Constrained Coloring. CPM 2009: 207-220 - [c8]Jiong Guo, Iyad A. Kanj, Christian Komusiewicz
Editing Graphs into Disjoint Unions of Dense Clusters. ISAAC 2009: 583-593 - [c7]Mathias Weller, Christian Komusiewicz
On Making Directed Graphs Transitive. WADS 2009: 542-553 - 2008
- [c6]Falk Hüffner
Enumerating Isolated Cliques in Synthetic and Financial Networks. COCOA 2008: 405-416 - [c5]Nadja Betzler, Michael R. Fellows
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM 2008: 31-43 - [c4]Christian Komusiewicz, Johannes Uhlmann:
A Cubic-Vertex Kernel for Flip Consensus Tree. FSTTCS 2008: 280-291 - [c3]Falk Hüffner
Fixed-Parameter Algorithms for Cluster Vertex Deletion. LATIN 2008: 711-722 - [c2]Jiong Guo, Falk Hüffner
Improved Algorithms for Bicluster Editing. TAMC 2008: 445-456 - 2007
- [c1]Christian Komusiewicz, Falk Hüffner
Isolation Concepts for Enumerating Dense Subgraphs. COCOON 2007: 140-150
Coauthor Index
[j62] [j43] [j40] [j39] [j38] [i20] [c53] [c49] [i16] [j32] [c45] [c44] [i14] [i13] [i11] [j28] [j23] [j21] [c39] [c34] [i8] [i6] [j18] [j17] [c29] [i4] [c27] [c26] [c23] [c22] [j12] [j11] [c21] [c17] [j9] [j8] [j7] [j6] [j5] [j4] [c14] [c13] [c12] [j2] [j1] [c11] [c10] [c9] [c7] [c6] [c5] [c3] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: