Felix Reidl

Algorithmica, August, 2023

Computing Complexity Measures of Degenerate Graphs.

[BibT_eX]

[DOI]

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

2022

When you come at the kings you best not miss.

[BibT_eX]

[DOI]

Oded Lachish

Chhaya Trehan

CoRR, 2022

Harmless Sets in Sparse Classes.

[BibT_eX]

[DOI]

Irene Muzi

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

When You Come at the King You Best Not Miss.

[BibT_eX]

[DOI]

Oded Lachish

Chhaya Trehan

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

Kernelization and hardness of harmless sets in sparse classes.

[BibT_eX]

[DOI]

Irene Muzi

CoRR, 2021

2020

Alternative parameterizations of Metric Dimension.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A General Kernelization Technique for Domination and Independence Problems in Sparse Classes.

[BibT_eX]

[DOI]

Carl Einarson

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Path-contractions, edge deletions and connectivity preservation.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs.

[BibT_eX]

[DOI]

Erik D. Demaine

J. Comput. Syst. Sci., 2019

Characterising bounded expansion by neighbourhood complexity.

[BibT_eX]

[DOI]

Konstantinos S. Stavropoulos

Eur. J. Comb., 2019

Longest paths in 2-edge-connected cubic graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Domination Above r-Independence: Does Sparseness Help?

[BibT_eX]

[DOI]

Carl Einarson

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2018

<i>k</i>-distinct in- and out-branchings in digraphs.

[BibT_eX]

[DOI]

Magnus Wahlström

J. Comput. Syst. Sci., 2018

Lower and Upper Bound for Computing the Size of All Second Neighbourhoods.

[BibT_eX]

[DOI]

George B. Mertzios

CoRR, 2018

Searching for Maximum Out-Degree Vertices in Tournaments.

[BibT_eX]

[DOI]

George B. Mertzios

CoRR, 2018

Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming.

[BibT_eX]

[DOI]

Li-Hsuan Chen

Algorithms, 2018

Parameterized Algorithms for Zero Extension and Metric Labelling Problems.

[BibT_eX]

[DOI]

Magnus Wahlström

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

A practical fpt algorithm for Flow Decomposition and transcript assembly.

[BibT_eX]

[DOI]

Andrew van der Poel

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

Kernelization using structural parameters on sparse graph classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Kirchoff Matrices and Pfaffians to Design Deterministic Polynomial-Space Parameterized Algorithms.

[BibT_eX]

[DOI]

CoRR, 2017

Being Even Slightly Shallow Makes Life Hard.

[BibT_eX]

[DOI]

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

k-Distinct In- and Out-Branchings in Digraphs.

[BibT_eX]

[DOI]

Magnus Wahlström

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Structural sparseness and complex networks.

[BibT_eX]

[DOI]

PhD thesis, 2016

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Width, depth and space.

[BibT_eX]

[DOI]

Li-Hsuan Chen

CoRR, 2016

Kernelization and Sparseness: the Case of Dominating Set.

[BibT_eX]

[DOI]

Markus Sortland Dregi

Saket Saurabh

Sebastian Siebertz

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models.

[BibT_eX]

[DOI]

Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2015

Zig-Zag Numberlink is NP-Complete.

[BibT_eX]

[DOI]

J. Inf. Process., 2015

Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

Fast Biclustering by Dual Parameterization.

[BibT_eX]

[DOI]

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

2014

Practical algorithms for MSO model-checking on tree-decomposable graphs.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2014

Overlapping Communities in Social Networks.

[BibT_eX]

[DOI]

CoRR, 2014

Kernelization and Sparseness: the case of Dominating Set.

[BibT_eX]

[DOI]

CoRR, 2014

Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms.

[BibT_eX]

[DOI]

Erik D. Demaine

CoRR, 2014

Finite Integer Index of Pathwidth and Treewidth.

[BibT_eX]

[DOI]

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

A Faster Parameterized Algorithm for Treedepth.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2012

Linear Kernels on Graphs Excluding Topological Minors

[BibT_eX]

[DOI]

CoRR, 2012

Evaluation of an MSO-Solver.

[BibT_eX]

[DOI]

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011

Hierarchical Clustering for Real-Time Stream Data with Noise.

[BibT_eX]

[DOI]

Philipp Kranen