Christian Komusiewicz

Philipp Heinrich Keßler

J. Comb. Optim., October, 2024

On Critical Node Problems with Vulnerable Vertices.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2024

Parameterized Local Search for Max <i>c</i>-Cut.

[BibT_eX]

[DOI]

CoRR, 2024

Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study.

[BibT_eX]

[DOI]

CoRR, 2024

On the Complexity of Community-Aware Network Sparsification.

[BibT_eX]

[DOI]

Emanuel Herrendorf

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints.

[BibT_eX]

[DOI]

Henning Martin Woydt

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Protective and Nonprotective Subset Sum Games: A Parameterized Complexity Analysis.

[BibT_eX]

[DOI]

Berthold Blatt Lorke

Proceedings of the Algorithmic Decision Theory - 8th International Conference, 2024

2023

The Parameterized Complexity of s-Club with Triangle and Seed Constraints.

[BibT_eX]

[DOI]

Theory Comput. Syst., October, 2023

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs.

[BibT_eX]

[DOI]

Algorithmica, July, 2023

Essentially Tight Kernels for (Weakly) Closed Graphs.

[BibT_eX]

[DOI]

Algorithmica, June, 2023

On computing exact means of time series using the move-split-merge metric.

[BibT_eX]

[DOI]

Jana Holznigenkemper

Bernhard Seeger

Data Min. Knowl. Discov., March, 2023

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs.

[BibT_eX]

[DOI]

Nils Jakob Eckstein

Discret. Math. Theor. Comput. Sci., 2023

A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem.

[BibT_eX]

[DOI]

CoRR, 2023

A Graph-Theoretic Formulation of Exploratory Blockmodeling.

[BibT_eX]

[DOI]

Alexander Bille

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation.

[BibT_eX]

[DOI]

Jana Holznigenkemper

Bernhard Seeger

Proceedings of the 2023 SIAM International Conference on Data Mining, 2023

On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric.

[BibT_eX]

[DOI]

Jana Holznigenkemper

Bernhard Seeger

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Parameterized Local Search for Max c-Cut.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

On Computing Optimal Tree Ensembles.

[BibT_eX]

[DOI]

Pascal Kunz

Proceedings of the International Conference on Machine Learning, 2023

On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem.

[BibT_eX]

[DOI]

Simone Linz

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

Exact Algorithms for Group Closeness Centrality.

[BibT_eX]

[DOI]

Luca Pascal Staus

Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics.

[BibT_eX]

[DOI]

Jannis Schramek

Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022

Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2022

Colored cut games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

Refined notions of parameterized enumeration kernels with applications to matching cut enumeration.

[BibT_eX]

[DOI]

Petr A. Golovach

Dieter Kratsch

Van Bang Le

J. Comput. Syst. Sci., 2022

Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2022

Covering Many (Or Few) Edges with k Vertices in Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021

Your rugby mates don't need to know your colleagues: Triadic closure with edge colors.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

Destroying Bicolored P<sub>3</sub>s by Deleting Few Edges.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2021

Enumerating connected induced subgraphs: Improved delay and experimental comparison.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Parameterized String Equations.

[BibT_eX]

[DOI]

Frances A. Rosamond

CoRR, 2021

Sorting by Multi-Cut Rearrangements.

[BibT_eX]

[DOI]

Géraldine Jean

Algorithms, 2021

Preventing Small (s,t)Cuts by Protecting Edges.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

On the Parameterized Complexity of Polytree Learning.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Can Local Optimality Be Used for Efficient Data Reduction?

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping.

[BibT_eX]

[DOI]

Mateus de Oliveira Oliveira

Meirav Zehavi

Theor. Comput. Sci., 2020

Solving Partition Problems Almost Always Requires Pushing Many Vertices Around.

[BibT_eX]

[DOI]

Iyad Kanj

Erik Jan van Leeuwen

SIAM J. Discret. Math., 2020

h-Index manipulation by undoing merges.

[BibT_eX]

[DOI]

Quant. Sci. Stud., 2020

Graph Motif Problems Parameterized by Dual.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

Parameterized algorithms for Module Map problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms.

[BibT_eX]

[DOI]

Dieter Kratsch

Van Bang Le

Discret. Appl. Math., 2020

Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems.

[BibT_eX]

[DOI]

CoRR, 2020

On the Relation of Strong Triadic Closure and Cluster Deletion.

[BibT_eX]

[DOI]

Algorithmica, 2020

Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs.

[BibT_eX]

[DOI]

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

String Factorizations Under Various Collision Constraints.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019

Assessing the computational complexity of multilayer subgraph detection.

[BibT_eX]

[DOI]

Netw. Sci., 2019

Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments.

[BibT_eX]

[DOI]

Marten Picker

Eur. J. Oper. Res., 2019

When Can Graph Hyperbolicity be Computed in Linear Time?

[BibT_eX]

[DOI]

Till Fluschnik

Algorithmica, 2019

2018

Tight Running Time Lower Bounds for Vertex Deletion Problems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2018

Parameterizing Edge Modification Problems Above Lower Bounds.

[BibT_eX]

[DOI]

Vincent Froese

Theory Comput. Syst., 2018

Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs.

[BibT_eX]

[DOI]

Erik Jan van Leeuwen

J. Comput. Syst. Sci., 2018

Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments.

[BibT_eX]

[DOI]

Marten Picker

CoRR, 2018

Matching algorithms for assigning orthologs after genome duplication events.

[BibT_eX]

[DOI]

Comput. Biol. Chem., 2018

On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure.

[BibT_eX]

[DOI]

Julien Fradin

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017

A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments.

[BibT_eX]

[DOI]

Networks, 2017

The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph.

[BibT_eX]

[DOI]

Julien Fradin

CoRR, 2017

The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration.

[BibT_eX]

[DOI]

Holger Dell

Nimrod Talmon

Mathias Weller

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Beyond Adjacency Maximization: Scaffold Filling for New String Distances.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Assessing the Computational Complexity of Multi-layer Subgraph Detection.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem.

[BibT_eX]

[DOI]

Maximilian Katzmann

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Kernelization, Partially Polynomial Kernels.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Parameterized complexity of critical node cuts.

[BibT_eX]

[DOI]

Danny Hermelin

Moshe Kaspi

Barak Navon

Theor. Comput. Sci., 2016

(Prefix) reversal distance for (signed) strings with few blocks or small alphabets.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

Multivariate Algorithmics for Finding Cohesive Subnetworks.

[BibT_eX]

[DOI]

Algorithms, 2016

H-index manipulation by merging articles: Models, theory, and experiments.

[BibT_eX]

[DOI]

Toby Walsh

Artif. Intell., 2016

The First Parameterized Algorithms and Computational Experiments Challenge.

[BibT_eX]

[DOI]

Frances A. Rosamond

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Twins in Subdivision Drawings of Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width.

[BibT_eX]

[DOI]

Nimrod Talmon

Gerhard J. Woeginger

Proceedings of the Discrete Optimization and Operations Research, 2016

2015

Towards an algorithmic guide to Spiral Galaxies.

[BibT_eX]

[DOI]

Shahrad Jamshidi

Theor. Comput. Sci., 2015

Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

On explaining integer vectors by few homogeneous segments.

[BibT_eX]

[DOI]

Ondrej Suchý

J. Comput. Syst. Sci., 2015

An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

On structural parameterizations for the 2-club problem.

[BibT_eX]

[DOI]

Ondrej Suchý

Discret. Appl. Math., 2015

Well-Formed Separator Sequences, with an Application to Hypergraph Drawing.

[BibT_eX]

[DOI]

CoRR, 2015

A graph modification approach for finding core-periphery structures in protein interaction networks.

[BibT_eX]

[DOI]

Sharon Bruckner

Algorithms Mol. Biol., 2015

The Parameterized Complexity of the Rainbow Subgraph Problem.

[BibT_eX]

[DOI]

Martin Rötzschke

Algorithms, 2015

Finding Supported Paths in Heterogeneous Networks.

[BibT_eX]

[DOI]

Hafedh Mohamed-Babou

Irena Rusu

Algorithms, 2015

Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments.

[BibT_eX]

[DOI]

Kolja Stahl

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Finding Highly Connected Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

On the Sound Covering Cycle Problem in Paired de Bruijn Graphs.

[BibT_eX]

[DOI]

Andreea Radulescu

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems.

[BibT_eX]

[DOI]

Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, 2015

2014

Local search for string problems: Brute-force is essentially optimal.

[BibT_eX]

[DOI]

Danny Hermelin

Theor. Comput. Sci., 2014

On the parameterized complexity of consensus clustering.

[BibT_eX]

[DOI]

Martin Dörnfelder

Mathias Weller

Theor. Comput. Sci., 2014

Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage.

[BibT_eX]

[DOI]

Adrian Liebtrau

IEEE ACM Trans. Comput. Biol. Bioinform., 2014

Multivariate Algorithmics for NP-Hard String Problems.

[BibT_eX]

[DOI]

Bull. EATCS, 2014

On Google Scholar H-Index Manipulation by Merging Articles.

[BibT_eX]

[DOI]

Toby Walsh

CoRR, 2014

A Cubic-Vertex Kernel for Flip Consensus Tree.

[BibT_eX]

[DOI]

Algorithmica, 2014

Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Reversal Distances for Strings with Few Blocks or Small Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

Evaluation of ILP-Based Approaches for Partitioning into Colorful Components.

[BibT_eX]

[DOI]

Sharon Bruckner

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

On Explaining Integer Vectors by Few Homogenous Segments.

[BibT_eX]

[DOI]

Ondrej Suchý

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications.

[BibT_eX]

[DOI]

Irena Rusu

Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

On Structural Parameterizations for the 2-Club Problem.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Parameterized computational complexity of finding small-diameter subgraphs.

[BibT_eX]

[DOI]

Alexander Schäfer

Optim. Lett., 2012

On making directed graphs transitive.

[BibT_eX]

[DOI]

Mathias Weller

J. Comput. Syst. Sci., 2012

Cluster editing with locally bounded modifications.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

An Analytical Approach to Network Motif Detection in Samples of Networks with Pairwise Different Vertex Labels.

[BibT_eX]

[DOI]

Christoph Schmidt

Thomas Weiss

Herbert Witte

Lutz Leistritz

Comput. Math. Methods Medicine, 2012

New Races in Parameterized Algorithmics.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Finding Dense Subgraphs of Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

Train Marshalling Is Fixed Parameter Tractable.

[BibT_eX]

[DOI]

Yiannis Koutis

Andreas Pfandler

Frances A. Rosamond

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Partitioning into Colorful Components by Minimum Edge Deletions.

[BibT_eX]

[DOI]

Sharon Bruckner

Sven Thiel

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Parameterized Algorithmics for Network Analysis: Clustering & Querying.

[BibT_eX]

[DOI]

PhD thesis, 2011

Parameterized Algorithmics for Finding Connected Motifs in Biological Networks.

[BibT_eX]

[DOI]

Nadja Betzler

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

Average parameterization and partial kernelization for computing medians.

[BibT_eX]

[DOI]

Nadja Betzler

J. Comput. Syst. Sci., 2011

Graph-based data clustering with overlaps.

[BibT_eX]

[DOI]

Discret. Optim., 2011

Editing Graphs into Disjoint Unions of Dense Clusters.

[BibT_eX]

[DOI]

Algorithmica, 2011

Alternative Parameterizations for Cluster Editing.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

2010

A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Fixed-Parameter Algorithms for Cluster Vertex Deletion.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Measuring Indifference: Unit Interval Vertex Deletion.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Exact Algorithms and Experiments for Hierarchical Tree Clustering.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Isolation concepts for efficiently enumerating dense subgraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Isolation concepts for clique enumeration: Comparison and computational experiments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On Generating Triangle-Free Graphs.

[BibT_eX]

[DOI]

Daniel Brügmann

Electron. Notes Discret. Math., 2009

Deconstructing Intractability: A Case Study for Interval Constrained Coloring.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

Improved Algorithms for Bicluster Editing.

[BibT_eX]

[DOI]

Yong Zhang

Proceedings of the Theory and Applications of Models of Computation, 2008

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems.

[BibT_eX]

[DOI]

Nadja Betzler

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

Enumerating Isolated Cliques in Synthetic and Financial Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Isolation Concepts for Enumerating Dense Subgraphs.

[BibT_eX]

[DOI]