Lars Jaffke

Orcid: 0000-0003-4856-5863

Affiliations:
  • University of Bergen, Norway


According to our database1, Lars Jaffke authored at least 42 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
b-Coloring Parameterized by Clique-Width.
Theory Comput. Syst., August, 2024

Diverse Pairs of Matchings.
Algorithmica, June, 2024

2023
On the maximum number of edges in planar graphs of bounded degree and matching number.
Discret. Math., August, 2023

Typical Sequences Revisited - Computing Width Parameters of Graphs.
Theory Comput. Syst., February, 2023

Fine-grained parameterized complexity analysis of graph coloring problems.
Discret. Appl. Math., 2023

Treewidth is NP-Complete on Cubic Graphs (and related results).
CoRR, 2023

A tight quasi-polynomial bound for Global Label Min-Cut.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

A logic-based algorithmic meta-theorem for mim-width.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Dynamic Programming on Bipartite Tree Decompositions.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Treewidth Is NP-Complete on Cubic Graphs.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Structural Parameterizations of b-Coloring.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
Well-partitioned chordal graphs.
Discret. Math., 2022

b-Coloring Parameterized by Pathwidth is XNLP-complete.
CoRR, 2022

Structural Parameterizations of Clique Coloring.
Algorithmica, 2022

Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory.
Artif. Intell., 2022

Classes of Intersection Digraphs with Good Algorithmic Properties.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

On the Hardness of Generalized Domination Problems Parameterized by Mim-Width.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

A Unifying Framework for Characterizing and Computing Width Measures.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Taming Graphs with No Large Creatures and Skinny Ladders.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Three Problems on Well-Partitioned Chordal Graphs.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
A complexity dichotomy for critical values of the <i>b</i>-chromatic number of graphs.
Theor. Comput. Sci., 2020

Mim-Width I. Induced path problems.
Discret. Appl. Math., 2020

Mim-Width II. The Feedback Vertex Set Problem.
Algorithmica, 2020

Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Hedonic Seat Arrangement Problems.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Mim-width III. Graph powers and generalized distance domination problems.
Theor. Comput. Sci., 2019

Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs.
CoRR, 2019

Diversity in Combinatorial Optimization.
CoRR, 2019

FPT Algorithms for Diverse Collections of Hitting Sets.
Algorithms, 2019

A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
On Weak Isomorphism of Rooted Vertex-Colored Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width.
Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

What Is Known About Vertex Cover Kernelization?
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017
Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees.
Eur. J. Comb., 2017

A note on the complexity of Feedback Vertex Set parameterized by mim-width.
CoRR, 2017

Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2015
MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs.
CoRR, 2015

Definability Equals Recognizability for k-Outerplanar Graphs.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015


  Loading...