Showing 1 - 20 of 105

1

Structural Parameters for Steiner Orientation
Hanaka, Tesshu ; Lampis, Michael ; Melissinos, Nikolaos ; et al.
ISAAC 2025, Dec 2025, Tainan, Taiwan. ⟨10.4230/LIPIcs.ISAAC.2025.38⟩

Tainan, Taiwan Theory of computation →... Treewidth Steiner Orientation ETH [INFO]Computer Science [...
Conference
Save to List
2

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
Foucaud, Florent ; Galby, Esther ; Khazaliya, Liana ; et al.
42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). :33-33

Jena, Germany Parameterized Complexity phrases Parameterized Co... ETH-based Lower Bounds Kernelization Vertex Cover
Conference
Save to List
3

Parameterized Maximum Node-Disjoint Paths
Lampis, Michael ; Vasilakis, Manolis ; Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE) ; et al.
IPEC 2025, Sep 2025, Warsaw, Poland. ⟨10.4230/LIPIcs.IPEC.2025.3⟩

Warsaw, Poland Theory of computation →... PIH Parameterized Complexity Maximum Node-Disjoint Pa... ETH
Conference
Save to List
4

On Maximum 2-Clubs
Dumont, Joanne ; Lampis, Michael ; Liedloff, Mathieu ; et al.
IPEC 2025, Sep 2025, Warsaw, Poland. ⟨10.4230/LIPIcs.IPEC.2025.13⟩

Warsaw, Poland parameterized algorithms Theory of computation →... SETH chordal graphs 2-clubs
Conference
Save to List
5

Parameterized Spanning Tree Congestion
Lampis, Michael ; Mitsou, Valia ; Nemery, Edouard ; et al.

Warsaw, Poland Graph Width Parameters Treewidth Theory of computation →... Vertex Integrity Treedepth
Conference
Save to List
6

The Complexity of Homomorphism Reconstructibility
Jan Böker ; Louis Härtel ; Nina Runde ; et al.
Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 19:1-19:20 (2024). doi:10.4230/LIPIcs.STACS.2024.19
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14
41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)

FOS: Computer and inform... Mathematics of computing... Discrete Mathematics (cs... Theory of computation →... graph homomorphism parameterised complexity
Academic journal
Save to List
7

Bandwidth Parameterized by Cluster Vertex Deletion Number
Gima, Tatsuya ; Kim, Eun Jung ; Köhler, Noleen ; et al.
18th International Symposium on Parameterized and Exact Computation, Sep 2023, Amsterdam, Netherlands. ⟨10.4230/LIPIcs.IPEC.2023.21⟩

Amsterdam, Netherlands Bandwidth Clique number Cluster vertex deletion... Parameterized complexity Theory of computation →...
Conference
Save to List
8

Algorithms and Complexity for Path Covers of Temporal DAGs
Chakraborty, Dibyayan ; Dailly, Antoine ; Foucaud, Florent ; et al.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). :38-38

Bratislava, Slovakia Temporal Graphs Dilworth’s Theorem DAGs Path Cover Temporally Disjoint Path...
Conference
Save to List
9

Practical Computation of Graph VC-Dimension
Coudert, David ; Csikós, Mónika ; Ducoffe, Guillaume ; et al.
SEA 2024 - Symposium on Experimental Algorithms. :20-20

Vienne, Austria VC-dimension Graphs Algorithm graph algorithm
Conference
Save to List
10

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
Robert Ganian ; Thekla Hamm ; Viktoriia Korchemna ; et al.
ACM Transactions on Algorithms. 20:1-26

FOS: Computer and inform... homomorphism 68R10 0102 computer and inform... G.2.2 Computational Complexity...
Academic journal
Save to List
11

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
Benjamin Bergougnoux ; Vera Chekan ; Robert Ganian ; et al.
ACM Transactions on Computation Theory.

FOS: Computer and inform... [INFO.INFO-DM] Computer... Parameterized complexity algebraic methods shrubdepth Data Structures and Algo...
Academic journal
Save to List
12

Sparsification Lower Bounds for List H -Coloring
Hubie Chen ; Bart M. P. Jansen ; Karolina Okrasa ; et al.
31st International Symposium on Algorithms and Computation (ISAAC 2020)

FOS: Computer and inform... sparsification Sparsification Theory of computation →... 0102 computer and inform... Computational Complexity...
Academic journal
Save to List
13

Computing Generalized Convolutions Faster Than Brute Force
Esmer, Barış Can ; Kulik, Ariel ; Marx, Dániel ; et al.
Algorithmica
17th International Symposium on Parameterized and Exact Computation
Leibniz International Proceedings in Informatics

0301 basic medicine FOS: Computer and inform... Fast Fourier Transform Generalized Convolution 0102 computer and inform... 01 natural sciences
Academic journal
Save to List
14

Fine-Grained Classification of Detecting Dominating Patterns
Dransfeld, Jonathan ; Künnemann, Marvin ; Redzic, Mirza ; et al.
ISSN: 1868-8969.

fine-grained complexity... domination in graphs subgraph isomorphism classification theorem parameterized algorithms Theory of computation →...
Academic journal
Save to List
15

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs
Künnemann, Marvin ; Redzic, Mirza
ISSN: 1868-8969.

Fine-grained complexity... Dominating set Sparsity in graphs Conditionally optimal al... Theory of computation →... Theory of computation →...
Academic journal
Save to List
16

Core Stability in Additively Separable Hedonic Games of Low Treewidth
Hanaka, Tesshu ; Köhler, Noleen ; Lampis, Michael ; et al.
ISAAC 2024, Dec 2024, Sydney (AUSTRALIA), Australia. ⟨10.4230/LIPIcs.ISAAC.2024.39⟩

Sydney (AUSTRALIA), Aust... Hedonic games Treewidth Core stability Mathematics of computing... Theory of computation →...
Conference
Save to List
17

Reducing the vertex cover number via edge contractions
Lima, Paloma T. ; dos Santos, Vinicius F. ; Sau, Ignasi ; et al.
Journal of Computer and System Sciences. 136:63-87

FOS: Computer and inform... Computer Networks and Co... Combinatorial Optimizati... 0211 other engineering a... Constraint Satisfaction... G.2.2
Academic journal
Save to List
18

Parameterized Max Min Feedback Vertex Set
Lampis, Michael ; Melissinos, Nikolaos ; Vasilakis, Manolis ; et al.
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). :62-62

Bordeaux, France ETH Feedback vertex set Parameterized algorithms Treewidth Theory of computation →...
Conference
Save to List
19

Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size: An Elementary Kernel of Quartic Size
Donkers, Huib ; Jansen, Bart M. P. ; Włodarczyk, Michał ; et al.
Algorithmica
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, IPEC 2021

outerplanar graphs FOS: Computer and inform... Outerplanar graphs Mathematics of computing... 0211 other engineering a... 0102 computer and inform...
Academic journal
Save to List
20

On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Jesper Nederlof ; Céline M. F. Swennenhuis ; Jesper Nederlof and Céline M. F. Swennenhuis ; et al.
Algorithmica
15th International Symposium on Parameterized and Exact Computation (IPEC 2020)

Fixed-Parameter Tractabi... Precedence Constraints Scheduling Fixed-parameter tractabi... Precedence constraints 0211 other engineering a...
Academic journal
Save to List

Filter