Showing 1 - 20 of 390

1

Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
Guruswami, Venkatesan ; Lin, Bingkai ; Ren, Xuandi ; et al.

Applied Mathematics Mathematical Sciences Fixed-parameter algorith... Hardness of approximatio... PCP theorems
Academic journal
Save to List
2

Elimination Distance to Dominated Clusters
Schirrmacher, Nicole ; Siebertz, Sebastian ; Vigny, Alexandre ; et al.

Graph theory FOS: Computer and inform... Discrete Mathematics (cs... Elimination distance Discrete Mathematics ddc:004
Academic journal
Save to List
3

When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices
Lokshtanov, Daniel ; Ramanujan, M.S. ; Saurabh, Saket
In Journal of Combinatorial Theory, Series B March 2026 177:143-185

Academic journal
Save to List
4

Fixed-parameter algorithms for unsplittable flow cover
Cristi, Andrés ; Mari, Mathieu ; Wiese, Andreas ; et al.
Theory of Computing Systems. 154:1-36

Unsplittable Flow Cover fixed parameter algorith... approximation al- gorith... [INFO]Computer Science [...
Journal
Save to List
5

Fractional domination and fractional total domination on Cayley digraphs of transformation semigroups with fixed sets
Nuttawoot Nupo ; Chollawat Pookpıenlert
AIMS Mathematics, Vol 9, Iss 6, Pp 14558-14573 (2024)

Combinatorics on Words transformation semigroup... Automata Theory and Form... Semigroup Domination analysis 0102 computer and inform...
Academic journal
Save to List
6

Hardness and Fixed Parameter Tractability for Pinwheel Scheduling Problems
Kobayashi, Yusuke ; Lin, Bingkai ; Yusuke Kobayashi and Bingkai Lin

Pinwheel Scheduling Polynomial-time Solvabil... Packing and Covering Fixed Parameter Algorith...
Academic journal
Save to List
7

Finding a minimum spanning tree with a small non-terminal set
Hanaka, Tesshu ; Kobayashi, Yasuaki
In Theoretical Computer Science 7 April 2025 1033

Academic journal
Save to List
8

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials
Komarath, Balagopal ; Pandey, Anurag ; Rahul, Chengot Sankaramenon ; et al.
Algorithmica. 85:2554-2579

Algebraic complexity Fixed-parameter algorith... Treewidth Graph homomorphisms Fine-grained complexity Algebraic circuits
Academic journal
Save to List
9

Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams: Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams
Arijit Bishnu ; Arijit Ghosh ; Sudeshna Kolay ; et al.
Theory of Computing Systems. 67:1241-1267

streaming algorithms Analysis of algorithms a... FPT Combinatorial Optimizati... Constraint Satisfaction... 0102 computer and inform...
Academic journal
Save to List
10

Shortest odd paths in undirected graphs with conservative weight functions
Jüttner, Alpár ; Király, Csaba ; Mendoza-Cadena, Lydia Mirabel ; et al.
In Discrete Applied Mathematics 15 November 2024 357:34-50

Academic journal
Save to List
11

Explainable graph clustering via expanders in the massively parallel computation model
Aghamolaei, Sepideh ; Ghodsi, Mohammad
In Information Sciences August 2024 677

Academic journal
Save to List
12

An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
Baste, Julien ; Watel, Dimitri ; Operational Research, Knowledge And Data (ORKAD) ; et al.
The 11th International Colloquium on Graph Theory and combinatorics. :1-30

Montpellier, France Spanning Tree Treewidth Graph algorithm Fixed-Parameter Tractabl... Fixed-Parameter Algorith...
Conference
Save to List
13

Twin-Width Meets Feedback Edges and Vertex Integrity
Balabán, Jakub ; Ganian, Robert ; Rocton, Mathis ; et al.

feedback edge number FOS: Computer and inform... fixed-parameter algorith... vertex integrity Computer Science - Data... twin-width
Academic journal
Save to List
14

Treewidth reduction for constrained separation and bipartization problems
Marx, Dániel ; O'Sullivan, Barry ; Razgon, Igor ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :561-572

Nancy, France fixed-parameter algorith... graph separation problem... treewidth ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC...
Conference
Save to List
15

Measuring what matters: A hybrid approach to dynamic programming with treewidth
Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; et al.
Journal of Computer and System Sciences. 121:57-75

FOS: Computer and inform... fixed-parameter algorith... 0211 other engineering a... 0102 computer and inform... 02 engineering and techn... rank-width
Academic journal
Save to List
16

Fixed-Parameter Algorithms for Unsplittable Flow Cover
Andrés Cristi ; Mathieu Mari ; Andreas Wiese ; et al.
Theory of Computing Systems. 67:89-124

Unsplittable Flow Cover fixed parameter algorith... 0202 electrical engineer... 0102 computer and inform... 02 engineering and techn... ddc:004
Academic journal
Save to List
17

Fixed-parameter algorithms for graph constraint logic
Hatanaka, Tatsuhiko ; Hommelsheim, Felix ; Ito, Takehiro ; et al.
In Theoretical Computer Science 30 May 2023 959

Academic journal
Save to List
18

High-multiplicity N-fold IP via configuration LP
Knop, Dušan ; Koutecký, Martin ; Levin, Asaf ; et al.
Mathematical Programming: A Publication of the Mathematical Optimization Society. 200(1):199-227

Academic journal
Save to List
19

Four-point condition matrices of edge-weighted trees
Ali Azimi ; Rakesh Jana ; Mukesh Kumar Nagar ; et al.
Special Matrices, Vol 12, Iss 1, Pp 133-150 (2024)

Artificial intelligence Computational Complexity Geometry 0102 computer and inform... four-point condition 01 natural sciences
Academic journal
Save to List
20

Towards an Algorithmic Guide to Spiral Galaxies
Fertin, Guillaume ; Jamshidi, Shahrad ; Komusiewicz, Christian ; et al.
Theoretical Computer Science. :26-39

fixed-parameter algorith... NP-hard problems one-player game [INFO.INFO-CC]Computer S... Computational Complexity...
Journal
Save to List

Filter