André Nichterlein

Inf. Process. Lett., 2025

On the hardness of problems around s-clubs on split graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

Parameterized Complexity of Segment Routing.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2025, 2025

On the Computational Complexity of Graph Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems.

[BibT_eX]

[DOI]

Commun. ACM, April, 2024

SpiderDAN: Matching Augmentation in Demand-Aware Networks.

[BibT_eX]

[DOI]

CoRR, 2024

Destroying Densest Subgraphs Is Hard.

[BibT_eX]

[DOI]

Cristina Bazgan

Sofia Vazquez Alferez

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation.

[BibT_eX]

[DOI]

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

2023

Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2023

Polynomial-time data reduction for weighted problems beyond additive goal functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., March, 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

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

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

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 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

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

[BibT_eX]

[DOI]

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

2019

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

[BibT_eX]

[DOI]

Networks, 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

Parameterized Complexity of Min-Power Asymmetric Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Efficient Computation of Optimal Temporal Walks Under Waiting-Time Constraints.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks and Their Applications VIII, 2019

Parameterized Complexity of Diameter.

[BibT_eX]

[DOI]

Matthias Bentert

Proceedings of the Algorithms and Complexity - 11th International Conference, 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

An Adaptive Version of Brandes' Algorithm for Betweenness Centrality.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Parameterized Dynamic Cluster Editing.

[BibT_eX]

[DOI]

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 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

Fixed-parameter algorithms for DAG Partitioning.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

When Can Graph Hyperbolicity Be Computed in Linear Time?

[BibT_eX]

[DOI]

Till Fluschnik

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

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

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Parameterized Aspects of Triangle Enumeration.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 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

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

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

[BibT_eX]

[DOI]

Vincent Froese

Marcel Koseler

Marcelo Garlet Millani

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 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

Finding Points in General Position.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Degree-constrained editing of small-degree graphs.

[BibT_eX]

[DOI]

PhD thesis, 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

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

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 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

Win-Win Kernelization for Degree Sequence Completion Problems.

[BibT_eX]

[DOI]

Vincent Froese

Proceedings of the Algorithm Theory - SWAT 2014, 2014

Parameterized Inapproximability of Degree Anonymization.

[BibT_eX]

[DOI]

Cristina Bazgan

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

Parameterized Inapproximability of Target Set Selection and Generalizations.

[BibT_eX]

[DOI]

Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

The Complexity of Degree Anonymization by Vertex Addition.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2014

Prices Matter for the Parameterized Complexity of Shift Bribery.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

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

A Refined Complexity Analysis of Degree Anonymization in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Parameterized Approximability of Maximizing the Spread of Influence in Networks.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 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

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

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

Constant Thresholds Can Make Target Set Selection Tractable.

[BibT_eX]

[DOI]

Proceedings of the Design and Analysis of Algorithms, 2012

Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

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]