André Nichterlein

Algorithmica, February, 2023

Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2023

Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions.

[BibT_eX]

[DOI]

Klaus Heeger

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Graph Clustering Problems Under the Lens of Parameterized Local Search.

[BibT_eX]

[DOI]

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Correlating Theory and Practice in Finding Clubs and Plexes.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2022

Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma.

[BibT_eX]

[DOI]

Niklas Wünsche

CoRR, 2022

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

[BibT_eX]

[DOI]

Frank Sommer

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

Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time.

[BibT_eX]

[DOI]

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

There and Back Again: On Applying Data Reduction Rules by Undoing Others.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Combating Collusion Rings Is Hard but Possible.

[BibT_eX]

[DOI]

Niclas Boehmer

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments.

[BibT_eX]

[DOI]

Viatcheslav Korenwein

Philipp Zschoche

ACM J. Exp. Algorithmics, 2021

Detecting and enumerating small induced subgraphs in c-closed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Parameterized Dynamic Cluster Editing.

[BibT_eX]

[DOI]

Algorithmica, 2021

The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Using a Geometric Lens to Find k Disjoint Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Parameterized Complexity of Min-Power Asymmetric Connectivity.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

Efficient computation of optimal temporal walks under waiting-time constraints.

[BibT_eX]

[DOI]

Appl. Netw. Sci., 2020

The Power of Linear-Time Data Reduction for Maximum Matching.

[BibT_eX]

[DOI]

Algorithmica, 2020

2019

A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths.

[BibT_eX]

[DOI]

Networks, 2019

Parameterized aspects of triangle enumeration.

[BibT_eX]

[DOI]

J. Comput. Syst. 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

Polynomial-Time Preprocessing for Weighted Problems Beyond Additive Goal Functions.

[BibT_eX]

[DOI]

CoRR, 2019

When Can Graph Hyperbolicity be Computed in Linear Time?

[BibT_eX]

[DOI]

Till Fluschnik

Algorithmica, 2019

A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs.

[BibT_eX]

[DOI]

Vincent Froese

Marcel Koseler

Marcelo Garlet Millani

Algorithmica, 2019

2018

A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Fractals for Kernelization Lower Bounds.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

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

[BibT_eX]

[DOI]

Marten Picker

CoRR, 2018

Towards Improving Brandes' Algorithm for Betweenness Centrality.

[BibT_eX]

[DOI]

CoRR, 2018

Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments.

[BibT_eX]

[DOI]

Viatcheslav Korenwein

Philipp Zschoche

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Kernelization Lower Bounds for Finding Constant-Size Subgraphs.

[BibT_eX]

[DOI]

Till Fluschnik

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

Finding Points in General Position.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2017

Fixed-parameter algorithms for DAG Partitioning.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2017

2016

Finding large degree-anonymous subgraphs is hard.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Win-win kernelization for degree sequence completion problems.

[BibT_eX]

[DOI]

Vincent Froese

J. Comput. Syst. Sci., 2016

Prices matter for the parameterized complexity of shift bribery.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Fine-Grained Algorithm Design for Matching.

[BibT_eX]

[DOI]

CoRR, 2016

A Parameterized Algorithmics Framework for Digraph Degree Sequence Completion Problems.

[BibT_eX]

[DOI]

Vincent Froese

Marcel Koseler

Marcelo Garlet Millani

CoRR, 2016

Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Degree-constrained editing of small-degree graphs.

[BibT_eX]

[DOI]

PhD thesis, 2015

The complexity of degree anonymization by vertex addition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs.

[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

A refined complexity analysis of degree anonymization in graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2015

On structural parameterizations for the 2-club problem.

[BibT_eX]

[DOI]

Ondrej Suchý

Discret. Appl. Math., 2015

Using Patterns to Form Homogeneous Teams.

[BibT_eX]

[DOI]

Algorithmica, 2015

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Falk Hüffner

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

A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths.

[BibT_eX]

[DOI]

Cristina Bazgan

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

Constant-factor approximations for Capacitated Arc Routing without triangle inequality.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

Constant Thresholds Can Make Target Set Selection Tractable.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Parameterized approximability of maximizing the spread of influence in networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

The effect of homogeneity on the computational complexity of combinatorial data anonymization.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 2014

Parameterized Inapproximability of Target Set Selection and Generalizations.

[BibT_eX]

[DOI]

Comput., 2014

Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks.

[BibT_eX]

[DOI]

Clemens Hoffmann

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Parameterized Inapproximability of Degree Anonymization.

[BibT_eX]

[DOI]

Cristina Bazgan

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

On tractable cases of Target Set Selection.

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2013

Pattern-Guided <i>k</i>-Anonymity.

[BibT_eX]

[DOI]

Algorithms, 2013

On Structural Parameterizations for the 2-Club Problem.

[BibT_eX]

[DOI]

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

The Complexity of Finding a Large Subgraph under Anonymity Constraints.

[BibT_eX]

[DOI]

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

On the Parameterized and Approximation Hardness of Metric Dimension.

[BibT_eX]

[DOI]

Proceedings of the 28th Conference on Computational Complexity, 2013

Parameterized Complexity of DAG Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2011

Aspects of a multivariate complexity analysis for Rectangle Tiling.

[BibT_eX]

[DOI]

Michael Dom

Oper. Res. Lett., 2011

Realizing Degree Sequences for Directed Acyclic Graphs is Hard

[BibT_eX]

[DOI]