


Остановите войну!
for scientists:
Christian Komusiewicz
Person information

Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j52]Petr A. Golovach
, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration. J. Comput. Syst. Sci. 123: 76-102 (2022) - [c80]Jaroslav Garvardt, Christian Komusiewicz
, Frank Sommer
:
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. IWOCA 2022: 313-326 - [c79]Jannik Schestag, Niels Grüttemeier
, Christian Komusiewicz
, Frank Sommer
:
On Critical Node Problems with Vulnerable Vertices. IWOCA 2022: 494-508 - [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 - [i36]Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer:
Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR abs/2201.05465 (2022) - [i35]Jaroslav Garvardt, Christian Komusiewicz, Frank Sommer:
The Parameterized Complexity of s-Club with Triangle and Seed Constraints. CoRR abs/2201.05654 (2022) - [i34]Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. CoRR abs/2204.02902 (2022) - 2021
- [j51]Laurent Bulteau
, Guillaume Fertin
, Géraldine Jean
, Christian Komusiewicz
:
Sorting by Multi-Cut Rearrangements. Algorithms 14(6): 169 (2021) - [j50]Christian Komusiewicz
, Frank Sommer:
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 $P_3$s by Deleting Few Edges. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j48]Laurent Bulteau
, Niels Grüttemeier
, Christian Komusiewicz, Manuel Sorge:
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
, Nils Morawietz:
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
, Géraldine Jean
, Christian Komusiewicz
:
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 $\mathbf {(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
, Christian Komusiewicz
:
On the Relation of Strong Triadic Closure and Cluster Deletion. Algorithmica 82(4): 853-880 (2020) - [j46]Christian Komusiewicz
, Dieter Kratsch, Van Bang Le:
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
, Christian Komusiewicz:
Graph Motif Problems Parameterized by Dual. J. Graph Algorithms Appl. 24(3): 371-396 (2020) - [j43]René van Bevern
, Christian Komusiewicz
, Hendrik Molter
, Rolf Niedermeier
, Manuel Sorge
, Toby Walsh
:
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
, Meirav Zehavi:
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
, Christian Komusiewicz
, Nils Morawietz, Frank Sommer
:
String Factorizations Under Various Collision Constraints. CPM 2020: 17:1-17:14 - [c68]Tomohiro Koana
, Christian Komusiewicz
, Frank Sommer
:
Exploiting c-Closure in Kernelization Algorithms for Graph Problems. ESA 2020: 65:1-65:17 - [c67]Nils Morawietz, Niels Grüttemeier
, Christian Komusiewicz
, Frank Sommer
:
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
, Christian Komusiewicz
, Frank Sommer
:
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. ISAAC 2020: 20:1-20:17 - [c64]Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz
, Frank Sommer
:
Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. SOFSEM 2020: 248-259 - [c63]Niels Grüttemeier
, Christian Komusiewicz
, Nils Morawietz:
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
, Rolf Niedermeier, Marten Picker:
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
, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge:
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
, Jannik Schestag, Frank Sommer
:
Destroying Bicolored P3s by Deleting Few Edges. CiE 2019: 193-204 - [c60]Christian Komusiewicz
, Frank Sommer
:
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
, Falk Hüffner
, Christian Komusiewicz, Manuel Sorge:
Matching algorithms for assigning orthologs after genome duplication events. Comput. Biol. Chem. 74: 379-390 (2018) - [j36]Iyad A. Kanj, Christian Komusiewicz
, Manuel Sorge, Erik Jan van Leeuwen:
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. J. Comput. Syst. Sci. 92: 22-47 (2018) - [j35]René van Bevern
, Vincent Froese, Christian Komusiewicz:
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
, Christian Komusiewicz
:
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
, Christian Komusiewicz, Manuel Sorge:
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
, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel Sorge:
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
, Guillaume Fertin
, Christian Komusiewicz:
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
, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh
:
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
, Guillaume Fertin
, Christian Komusiewicz:
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets. J. Discrete Algorithms 37: 44-55 (2016) - [j29]Danny Hermelin
, Moshe Kaspi
, Christian Komusiewicz
, Barak Navon:
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
, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon
, Gerhard J. Woeginger:
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. Graph Drawing 2016: 67-80 - [c43]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: 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
, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke:
The Parameterized Complexity of the Rainbow Subgraph Problem. Algorithms 8(1): 60-81 (2015) - [j27]Guillaume Fertin
, Christian Komusiewicz, Hafedh Mohamed-Babou, Irena Rusu:
Finding Supported Paths in Heterogeneous Networks. Algorithms 8(4): 810-831 (2015) - [j26]Sharon Bruckner, Falk Hüffner
, Christian Komusiewicz:
A graph modification approach for finding core-periphery structures in protein interaction networks. Algorithms Mol. Biol. 10: 16 (2015) - [j25]Sepp Hartung, Christian Komusiewicz
, André Nichterlein, Ondrej Suchý
:
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ý
, Mathias Weller:
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. SIAM J. Discret. Math. 29(1): 1-25 (2015) - [j20]Guillaume Fertin
, Shahrad Jamshidi, Christian Komusiewicz
:
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
, Moshe Kaspi
, Christian Komusiewicz, Barak Navon:
Parameterized Complexity of Critical Node Cuts. IPEC 2015: 343-354 - [c37]Falk Hüffner
, Christian Komusiewicz, Manuel Sorge:
Finding Highly Connected Subgraphs. SOFSEM 2015: 254-265 - [c36]Falk Hüffner
, Christian Komusiewicz, André Nichterlein:
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
, Johannes Uhlmann:
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
, Christian Komusiewicz
, Adrian Liebtrau, Rolf Niedermeier:
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
, Christian Komusiewicz
:
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
, Mathias Weller:
On the parameterized complexity of consensus clustering. Theor. Comput. Sci. 542: 71-82 (2014) - [c33]Laurent Bulteau
, Guillaume Fertin
, Christian Komusiewicz:
Reversal Distances for Strings with Few Blocks or Small Alphabets. CPM 2014: 50-59 - [c32]Guillaume Fertin
, Shahrad Jamshidi, Christian Komusiewicz
:
Towards an Algorithmic Guide to Spiral Galaxies. FUN 2014: 171-182 - [c31]Laurent Bulteau
, Christian Komusiewicz:
Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable. SODA 2014: 102-121 - [c30]Sharon Bruckner, Falk Hüffner
, Christian Komusiewicz:
A Graph Modification Approach for Finding Core-Periphery Structures in Protein Interaction Networks. WABI 2014: 340-351 - [c29]Falk Hüffner
, Christian Komusiewicz
, Rolf Niedermeier, Martin Rötzschke:
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
, Christian Komusiewicz
:
Local Search for String Problems: Brute Force Is Essentially Optimal. CPM 2013: 130-141 - [c27]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: 361-371 - [c26]