scientific article; zbMATH DE number 3974318
From MaRDI portal
Publication:3740256
Recommendations
Cited in
(53)- The \(k\)-distinct language: parameterized automata constructions
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Finding and counting given length cycles
- Approximating the longest paths in grid graphs
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Counting Homomorphic Cycles in Degenerate Graphs
- Finding monotone paths in edge-ordered graphs
- Finding a smallest odd hole in a claw-free graph using global structure
- Faster deterministic parameterized algorithm for \(k\)-path
- Spotting trees with few leaves
- Spotting trees with few leaves
- A faster parameterized algorithm for temporal matching
- scientific article; zbMATH DE number 7525484 (Why is no real title available?)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- scientific article; zbMATH DE number 682567 (Why is no real title available?)
- Deterministic subgraph detection in broadcast CONGEST
- Detours in directed graphs
- On approximating the longest path in a graph
- Finding even cycles even faster
- Graph pattern detection: hardness for all induced patterns and faster noninduced cycles
- Finding detours is fixed-parameter tractable
- QUBO formulations of the longest path problem
- Complexity of searching an immobile hider in a graph
- Narrow sieves for parameterized paths and packings
- A streaming algorithm for the undirected longest path problem
- A parameterized view on matroid optimization problems
- The even-path problem for graphs and digraphs
- Gerrymandering on graphs: computational complexity and parameterized algorithms
- Finding even subgraphs even faster
- On the complexity of database queries
- Long directed \((s,t)\)-path: FPT algorithm
- Multistage \(s-t\) path: confronting similarity with dissimilarity
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- scientific article; zbMATH DE number 3912415 (Why is no real title available?)
- On problems with short certificates
- Finding detours is fixed-parameter tractable
- Algorithms for long paths in graphs
- Maintaining longest paths incrementally
- Mixing Color Coding-Related Techniques
- Parameterized complexity and subexponential-time computability
- Deterministic algorithms for matching and packing problems based on representative sets
- Algorithm engineering for color-coding with applications to signaling pathway detection
- scientific article; zbMATH DE number 3948312 (Why is no real title available?)
- Scheduling for single agile satellite, redundant targets problem using complex networks theory
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard)
- Parameterized algorithms for list \(K\)-cycle
- Finding a Path of Superlogarithmic Length
- scientific article; zbMATH DE number 2119679 (Why is no real title available?)
- Representative families: a unified tradeoff-based approach
- Revising Johnson's table for the 21st century
- A theory of even functionals and their algorithmic applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740256)
