Katrin Casel

Discret. Appl. Math., December, 2023

Combinatorial Properties and Recognition of Unit Square Visibility Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., June, 2023

Fine-Grained Complexity of Regular Path Queries.

[BibT_eX]

[DOI]

Markus L. Schmid

Log. Methods Comput. Sci., 2023

From symmetry to asymmetry: Generalizing TSP approximations by parametrization.

[BibT_eX]

[DOI]

Lukas Behrendt

Alexander Löser

Marcus Wilhelm

J. Comput. Syst. Sci., 2023

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2023

Open Problems in (Hyper)Graph Decomposition.

[BibT_eX]

[DOI]

CoRR, 2023

Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs.

[BibT_eX]

[DOI]

Davis Issac

Aikaterini Niklanovits

Ziena Zeif

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

Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover.

[BibT_eX]

[DOI]

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

Fair Correlation Clustering in Forests.

[BibT_eX]

[DOI]

Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023

Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022

On the complexity of solution extension of optimization problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Zeros and approximations of Holant polynomials on the complex plane.

[BibT_eX]

[DOI]

Comput. Complex., 2022

Dense Graph Partitioning on Sparse and Dense Graphs.

[BibT_eX]

[DOI]

Cristina Bazgan

Pierre Cazals

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set.

[BibT_eX]

[DOI]

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

Fixed-Parameter Sensitivity Oracles.

[BibT_eX]

[DOI]

Martin Schirneck

Simon Wietheger

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics.

[BibT_eX]

[DOI]

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

On Counting (Quantum-)Graph Homomorphisms in Finite Fields of Prime Order.

[BibT_eX]

[DOI]

Andreas Göbel

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

Balanced Crown Decomposition for Connectivity Constraints.

[BibT_eX]

[DOI]

Davis Issac

Aikaterini Niklanovits

Ziena Zeif

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Abundant Extensions.

[BibT_eX]

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

Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs.

[BibT_eX]

[DOI]

Ralf Borndörfer

Fernando Sánchez Villaamil

Davis Issac

Aikaterini Niklanovits

Stephan Schwartz

Ziena Zeif

Proceedings of the Approximation, 2021

2020

Complexity of independency and cliquy trees.

[BibT_eX]

[DOI]

Markus L. Schmid

Erik Jan van Leeuwen

Discret. Appl. Math., 2020

Domination chain: Characterisation, classical complexity, parameterised complexity and approximability.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

On Counting (Quantum-)Graph Homomorphisms in Finite Fields.

[BibT_eX]

[DOI]

Andreas Göbel

CoRR, 2020

The node weight dependent traveling salesperson problem: approximation algorithms and randomized search heuristics.

[BibT_eX]

[DOI]

Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Extension of Some Edge Graph Problems: Standard and Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Extension of Vertex Cover and Independent Set in Some Classes of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

The many facets of upper domination.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Extension of vertex cover and independent set in some classes of graphs and generalizations.

[BibT_eX]

[DOI]

CoRR, 2018

Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework.

[BibT_eX]

[DOI]

Algorithmica, 2018

Resolving Conflicts for Lower-Bounded Clustering.

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

2016

Weak total resolvability in graphs.

[BibT_eX]

[DOI]

Alejandro Estrada-Moreno

Juan Alberto Rodríguez-Velázquez

Discuss. Math. Graph Theory, 2016

Upper Domination: Complexity and Approximation.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Building Clusters with Lower-Bounded Sizes.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

On the Complexity of Grammar-Based Compression over Fixed Alphabets.

[BibT_eX]

[DOI]

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

On the Complexity Landscape of the Domination Chain.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

Algorithmic Aspects of Upper Domination: A Parameterised Perspective.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

Algorithmic Aspects of Upper Domination.

[BibT_eX]

[DOI]

CoRR, 2015

2014

A Fixed-Parameter Approach for Privacy-Protection with Global Recoding.

[BibT_eX]

[DOI]