default search action
Lars Jaffke
Person information
- affiliation: University of Bergen, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. Algorithmica 86(6): 2026-2040 (2024) - [j13]Lars Jaffke
, Paloma T. Lima, Daniel Lokshtanov:
b-Coloring Parameterized by Clique-Width. Theory Comput. Syst. 68(4): 1049-1081 (2024) - 2023
- [j12]Lars Jaffke
Fine-grained parameterized complexity analysis of graph coloring problems. Discret. Appl. Math. 327: 33-46 (2023) - [j11]Lars Jaffke
On the maximum number of edges in planar graphs of bounded degree and matching number. Discret. Math. 346(8): 113431 (2023) - [j10]Hans L. Bodlaender
Typical Sequences Revisited - Computing Width Parameters of Graphs. Theory Comput. Syst. 67(1): 52-88 (2023) - [c28]Lars Jaffke, Paloma T. Lima, Roohani Sharma:
Structural Parameterizations of b-Coloring. ISAAC 2023: 40:1-40:14 - [c27]Hans L. Bodlaender
Treewidth Is NP-Complete on Cubic Graphs. IPEC 2023: 7:1-7:13 - [c26]Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming on Bipartite Tree Decompositions. IPEC 2023: 26:1-26:22 - [c25]Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza:
A tight quasi-polynomial bound for Global Label Min-Cut. SODA 2023: 290-303 - [c24]Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge:
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. SODA 2023: 3229-3244 - [c23]Benjamin Bergougnoux, Jan Dreier, Lars Jaffke:
A logic-based algorithmic meta-theorem for mim-width. SODA 2023: 3282-3304 - [i27]Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR abs/2301.10031 (2023) - [i26]Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic programming on bipartite tree decompositions. CoRR abs/2309.07754 (2023) - 2022
- [j9]Julien Baste
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory. Artif. Intell. 303: 103644 (2022) - [j8]Lars Jaffke, Paloma T. Lima
Structural Parameterizations of Clique Coloring. Algorithmica 84(2): 273-303 (2022) - [j7]Jungho Ahn, Lars Jaffke
Well-partitioned chordal graphs. Discret. Math. 345(10): 112985 (2022) - [c22]Jakub Gajarský
Taming Graphs with No Large Creatures and Skinny Ladders. ESA 2022: 58:1-58:8 - [c21]Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon:
A Unifying Framework for Characterizing and Computing Width Measures. ITCS 2022: 63:1-63:23 - [c20]Brage I. K. Bakkane, Lars Jaffke:
On the Hardness of Generalized Domination Problems Parameterized by Mim-Width. IPEC 2022: 3:1-3:19 - [c19]Hans L. Bodlaender
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. IPEC 2022: 8:1-8:18 - [c18]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Classes of Intersection Digraphs with Good Algorithmic Properties. STACS 2022: 38:1-38:18 - [i25]Benjamin Bergougnoux, Jan Dreier, Lars Jaffke:
A logic-based algorithmic meta-theorem for mim-width. CoRR abs/2202.13335 (2022) - [i24]Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza:
Taming graphs with no large creatures and skinny ladders. CoRR abs/2205.01191 (2022) - [i23]Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge:
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. CoRR abs/2207.07425 (2022) - [i22]Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Uéverton S. Souza:
A tight quasi-polynomial bound for Global Label Min-Cut. CoRR abs/2207.07426 (2022) - [i21]Lars Jaffke, Paloma T. Lima, Roohani Sharma:
b-Coloring Parameterized by Pathwidth is XNLP-complete. CoRR abs/2209.07772 (2022) - 2021
- [c17]Jungho Ahn
Three Problems on Well-Partitioned Chordal Graphs. CIAC 2021: 23-36 - [c16]Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov:
b-Coloring Parameterized by Clique-Width. STACS 2021: 43:1-43:15 - [i20]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Classes of intersection digraphs with good algorithmic properties. CoRR abs/2105.01413 (2021) - [i19]Eduard Eiben, Robert Ganian, Thekla Hamm, Lars Jaffke, O-joung Kwon:
A Unifying Framework for Characterizing and Computing Width Measures. CoRR abs/2109.14610 (2021) - 2020
- [j6]Lars Jaffke
Mim-Width II. The Feedback Vertex Set Problem. Algorithmica 82(1): 118-145 (2020) - [j5]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Mim-Width I. Induced path problems. Discret. Appl. Math. 278: 153-168 (2020) - [j4]Lars Jaffke, Paloma T. Lima
A complexity dichotomy for critical values of the b-chromatic number of graphs. Theor. Comput. Sci. 815: 182-196 (2020) - [c15]Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden:
Hedonic Seat Arrangement Problems. AAMAS 2020: 1777-1779 - [c14]Julien Baste
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory. IJCAI 2020: 1119-1125 - [c13]Fedor V. Fomin
Diverse Pairs of Matchings. ISAAC 2020: 26:1-26:12 - [c12]Lars Jaffke
Structural Parameterizations of Clique Coloring. MFCS 2020: 49:1-49:15 - [c11]Lars Jaffke
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. MFCS 2020: 50:1-50:15 - [c10]Hans L. Bodlaender
Typical Sequences Revisited - Computing Width Parameters of Graphs. STACS 2020: 57:1-57:16 - [c9]Jungho Ahn
Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. WG 2020: 148-160 - [i18]Lars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary:
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. CoRR abs/2001.05583 (2020) - [i17]Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima:
Well-partitioned chordal graphs: obstruction set and disjoint paths. CoRR abs/2002.10859 (2020) - [i16]Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden:
Hedonic Seat Arrangement Problems. CoRR abs/2002.10898 (2020) - [i15]Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov:
b-Coloring Parameterized by Clique-Width. CoRR abs/2003.04254 (2020) - [i14]Lars Jaffke, Paloma T. Lima, Geevarghese Philip:
Structural Parameterizations of Clique Coloring. CoRR abs/2005.04733 (2020) - [i13]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. CoRR abs/2009.04567 (2020)
2010 – 2019
- 2019
- [j3]Julien Baste
FPT Algorithms for Diverse Collections of Hitting Sets. Algorithms 12(12): 254 (2019) - [j2]Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme
Mim-width III. Graph powers and generalized distance domination problems. Theor. Comput. Sci. 796: 216-236 (2019) - [c8]Lars Jaffke
A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs. MFCS 2019: 34:1-34:13 - [i12]Julien Baste, Michael R. Fellows, Lars Jaffke, Tomás Masarík
Diversity in Combinatorial Optimization. CoRR abs/1903.07410 (2019) - [i11]Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle:
Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs. CoRR abs/1905.03643 (2019) - [i10]Julien Baste, Lars Jaffke, Tomás Masarík
FPT Algorithms for Diverse Collections of Hitting Sets. CoRR abs/1911.05032 (2019) - 2018
- [c7]Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller:
What Is Known About Vertex Cover Kernelization? Adventures Between Lower Bounds and Higher Altitudes 2018: 330-356 - [c6]Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width. IPEC 2018: 6:1-6:14 - [c5]Lars Jaffke
A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. STACS 2018: 42:1-42:14 - [c4]Lars Jaffke
On Weak Isomorphism of Rooted Vertex-Colored Graphs. WG 2018: 266-278 - [i9]Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle:
Generalized distance domination problems and their complexity on graphs of bounded mim-width. CoRR abs/1803.03514 (2018) - [i8]Lars Jaffke, Paloma T. Lima:
A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs. CoRR abs/1811.03966 (2018) - [i7]Michael R. Fellows, Lars Jaffke, Aliz Izabella Király, Frances A. Rosamond, Mathias Weller:
What is known about Vertex Cover Kernelization? CoRR abs/1811.09429 (2018) - 2017
- [j1]Lars Jaffke
Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. Eur. J. Comb. 66: 191-234 (2017) - [c3]Lars Jaffke
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. CIAC 2017: 345-356 - [c2]Lars Jaffke
Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. IPEC 2017: 21:1-21:13 - [i6]Lars Jaffke, Bart M. P. Jansen:
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. CoRR abs/1701.06985 (2017) - [i5]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width. CoRR abs/1708.04536 (2017) - [i4]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width. CoRR abs/1710.07148 (2017) - [i3]Lars Jaffke, O-joung Kwon, Jan Arne Telle:
A note on the complexity of Feedback Vertex Set parameterized by mim-width. CoRR abs/1711.05157 (2017) - 2015
- [c1]Lars Jaffke
Definability Equals Recognizability for k-Outerplanar Graphs. IPEC 2015: 175-186 - [i2]Lars Jaffke, Hans L. Bodlaender
MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs. CoRR abs/1503.01604 (2015) - [i1]Lars Jaffke, Hans L. Bodlaender:
Definability Equals Recognizability for $k$-Outerplanar Graphs. CoRR abs/1509.08315 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: