yusuke1997/dblp-id-title huggingface dataset:
An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs
Odd Multiway Cut in Directed Acyclic Graphs
Polynomial Kernels for Strictly Chordal Edge Modification Problems
Parameterized Complexity of Vehicle Routing
Combining Crown Structures for Vulnerability Measures
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width
AND-compression of NP-complete Problems: Streamlined Proof and Minor Observations
A Polynomial Kernel for Funnel Arc Deletion Set
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity
Randomised Enumeration of Small Witnesses Using a Decision Oracle
Quasi-Linear Distance Query Reconstruction for Graphs of Bounded Treelength
Bounded Fixed-Parameter Tractability: The Case 2poly(k)
PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem
Fixed-Parameter and Approximation Algorithms: A New Look
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter
Twin-Width Meets Feedback Edges and Vertex Integrity
Parameterized Complexity of Firefighting Revisited
Online Problems, Pathwidth, and Persistence
Improved Parameterized Algorithms for Network Query Problems
Computing Graph Distances Parameterized by Treewidth and Diameter
Two Edge Modification Problems without Polynomial Kernels
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
A Polynomial Delay Algorithm Generating All Potential Maximal Cliques in Triconnected Planar Graphs
Treewidth and Pure Nash Equilibria
Parameterized Graph Separation Problems
PACE Solver Description: Minimum Hitting Set Computation via Core-Guided MaxSAT Solving
On Kernelization and Approximation for the Vector Connectivity Problem
Finding Good Decompositions for Dynamic Programming on Dense Graphs
PACE Solver Description: CRGone
On Polynomial Kernelization of H -free Edge Deletion
A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition
Cut and Count and Representative Sets on Branch Decompositions
PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization
Restricted and Swap Common Superstring: A Parameterized View
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation
Packing Edge Disjoint Triangles: A Parameterized View
Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor
Bandwidth Parameterized by Cluster Vertex Deletion Number
On the Space Complexity of Parameterized Problems
Reconfiguration over Tree Decompositions
Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
The Minimum Weight Triangulation Problem with Few Inner Points
On Satisfiability Problems with a Linear Structure
Width Parameterizations for Knot-Free Vertex Deletion on Digraphs
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers
Fast Biclustering by Dual Parameterization
On Digraph Width Measures in Parameterized Algorithmics
FPT Approximation for Fair Minimum-Load Clustering
An O*(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
Protrusions in Graphs and Their Applications
Counting Problems in Parameterized Complexity
FO Model Checking of Geometric Graphs
Computing Kernels in Parallel: Lower and Upper Bounds
On Cutwidth Parameterized by Vertex Cover
On Extended Formulations For Parameterized Steiner Trees
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs
Improved Parameterized Algorithms for the Kemeny Aggregation Problem
Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover
Exact Algorithms for List-Coloring of Intersecting Hypergraphs
FPT Inapproximability of Directed Cut and Connectivity Problems
An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion
On the Ordered List Subgraph Embedding Problems
Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs
Graph Clustering Problems Under the Lens of Parameterized Local Search
The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization
Preprocessing to Reduce the Search Space for Odd Cycle Transversal
Partitioning into Sets of Bounded Cardinality
Meta-kernelization using Well-structured Modulators
On Finding Directed Trees with Many Leaves
FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters
20th International Symposium on Parameterized and Exact Computation, IPEC 2025, Warsaw, Poland, September 17-19, 2025
Minimum Separator Reconfiguration
Finding Dense Subgraphs of Sparse Graphs
Parameterized Complexity of Multi-Node Hubs
A Structural View on Parameterizing Problems: Distance from Triviality
Smaller Kernels for Hitting Set Problems of Constant Arity
The k -Distinct Language: Parameterized Automata Constructions
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
A Polynomial Kernel for Block Graph Deletion
Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs
Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms
The Graph Motif Problem Parameterized by the Structure of the Input Graph
Dynamic Parameterized Feedback Problems in Tournaments
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
Chain Minors Are FPT
Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
PACE Solver Description: OCMu64, a Solver for One-Sided Crossing Minimization
Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, The Netherlands, September 6-8, 2023
A Faster FPT Algorithm for Bipartite Contraction
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM)
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
On Finding Short Resolution Refutations and Small Unsatisfiable Subsets
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
Resolving Conflicts for Lower-Bounded Clustering
On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width
Kernelizing Temporal Exploration Problems
Incompressibility of H-Free Edge Modification
Towards Exact Structural Thresholds for Parameterized Complexity
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover
The Time Complexity of Constraint Satisfaction
Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
Multivariate Analysis of Orthogonal Range Searching and Graph Distances
Parameterized Complexity in Multiple-Interval Graphs: Domination
Dual Parameterization of Weighted Coloring
Finding Shortest Paths Between Graph Colourings
Parameterized Complexity of Graph Constraint Logic
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard)
PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
PACE Solver Description: PID^⋆
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices
Safe Approximation and Its Relation to Kernelization
Computing Pathwidth Faster Than 2 n
On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs
Parameterized Derandomization
Deterministically Counting k-Paths and Trees Parameterized by Treewidth in Single-Exponential Time
Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n
Parameterized Complexity of Scheduling Chains of Jobs with Delays
PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth
Modularity Clustering Parameterized by Max Leaf Number
Vertex Deletion into Bipartite Permutation Graphs
Parameterized Complexity and Approximability of the SLCS Problem
Kernels: Annotated, Proper and Induced
On the Parameterized Complexity of Computing Tree-Partitions
Computing Small Search Numbers in Linear Time
A Direct Algorithm for the Parameterized Face Cover Problem
A Polynomial Kernel for Bipartite Permutation Vertex Deletion
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration
Faster Subgraph Counting in Sparse Graphs
Parameterized Complexity Results in Symmetry Breaking
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
Quantified Conjunctive Queries on Partially Ordered Sets
Balanced Hashing, Color Coding and Approximate Counting
On the Directed Degree-Preserving Spanning Tree Problem
A Purely Democratic Characterization of W[1]
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
Partial Kernelization for Rank Aggregation: Theory and Experiments
Towards a Theory of Parameterized Streaming Algorithms
PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem
Kick the Cliques
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
Clustering to Given Connectivities
Strong ETH and Resolution via Games and the Multiplicity of Strategies
Enumerating Neighbour and Closest Strings
PACE Solver Description: UzL Solver for Dominating Set and Hitting Set
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms
Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width
Stretch-Width
Optimal Dynamic Program for r-Domination Problems over Tree Decompositions
An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange
Kernelization for Orthogonality Dimension
Dynamic Programming on Bipartite Tree Decompositions
Towards a Taxonomy of Techniques for Designing Parameterized Algorithms
On the Workflow Satisfiability Problem with Class-independent Constraints
A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items
Integer Programming in Parameterized Complexity: Three Miniatures
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable
Structural Parameterizations with Modulator Oblivion
Solving Linear Equations Parameterized by Hamming Weight
Hardness of r-dominating set on Graphs of Diameter (r + 1)
Parameterized and Approximation Algorithms for the Load Coloring Problem
Exact Exponential Algorithms for Clustering Problems
On the Parameterized Complexity of Contraction to Generalization of Trees
Parameterized Maximum Path Coloring
Parameterized Algorithms for Maximum Cut with Connectivity Constraints
Practical Algorithms for Linear Boolean-width
PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth
Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT
15th International Symposium on Parameterized and Exact Computation, IPEC 2020, Hong Kong (Virtual Conference), December 14-18, 2020
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
The First Parameterized Algorithms and Computational Experiments Challenge
On the Complexity of Problems on Tree-Structured Graphs
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs
11th International Symposium on Parameterized and Exact Computation, IPEC 2016, Aarhus, Denmark, August 24-26, 2016
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
New Algorithms for Mixed Dominating Set
Computing Complexity Measures of Degenerate Graphs
PACE Solver Description: μSolver - Heuristic Track
Enumerate and Measure: Improving Parameter Budget Management
Metric Dimension Parameterized by Treewidth
An Improved Kernelization Algorithm for Trivially Perfect Editing
Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
PACE Solver Description: Weighting-Based Local Search Heuristic for the Hitting Set Problem
13th International Symposium on Parameterized and Exact Computation, IPEC 2018, Helsinki, Finland, August 20-24, 2018
A Completeness Theory for Polynomial (Turing) Kernelization
A Polynomial Kernel for Deletion to Ptolemaic Graphs
Fixed-Parameter Complexity of Minimum Profile Problems
On the Hardness of Generalized Domination Problems Parameterized by Mim-Width
PACE Solver Description: Sallow: A Heuristic Algorithm for Treedepth Decompositions
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
Hamiltonicity Parameterized by Mim-Width Is (Indeed) Para-NP-Hard
PACE Solver Description: Zygosity
Bidimensionality and Parameterized Algorithms (Invited Talk)
On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Best-Case and Worst-Case Sparsifiability of Boolean CSPs
Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial
The Cluster Editing Problem: Implementations and Experiments
Practical FPT Implementations and Applications (Invited Talk)
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
Proper Interval Vertex Deletion
The Parameterized Complexity of Dependency Detection in Relational Databases
Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
PACE Solver Description: Reductions and Heuristic Search for the Dominating Set Problem and the Hitting Set Problem
Roman Hitting Functions
Turbocharging Treewidth Heuristics
Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers
Backdoors for Linear Temporal Logic
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism
Parameterized Complexity of Scheduling Unit-Time Jobs with Generalized Precedence Constraints
A Contraction-Recursive Algorithm for Treewidth
Parameterized Approximation Problems
Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size
Parameterised Distance to Local Irregularity
Tight Bounds for Connected Odd Cycle Transversal Parameterized by Clique-Width
Cutwidth: Obstructions and Algorithmic Aspects
PACE Solver Description: Hydra Prime
PACE Solver Description: Touiouidth
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
On Multiway Cut Parameterized above Lower Bounds
PACE Solver Description: GraPA-JAVA
Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set
The Complexity of Satisfiability of Small Depth Circuits
PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT
Existential Second-Order Logic over Graphs: Parameterized Complexity
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth
Computing Treewidth on the GPU
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm
14th International Symposium on Parameterized and Exact Computation, IPEC 2019, Munich, Germany, September 11-13, 2019
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time
Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers
Kernel Bounds for Path and Cycle Problems
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
Finding Secluded Places of Special Interest in Graphs
Twin-Width Is Linear in the Poset Width
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties
Structural Parameterizations of Feedback Vertex Set
Parameterized Complexity of Perfectly Matched Sets
The Lost Continent of Polynomial Time: Preprocessing and Kernelization
PACE Solver Description: SMS
Chordless Paths Through Three Vertices
Bounding the Mim-Width of Hereditary Graph Classes
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees
Parameter Compilation
On the Kernelization Complexity of Colorful Motifs
Editing to a Graph of Given Degrees
The Parameterized Complexity of Geometric Graph Isomorphism
Slim Tree-Cut Width
PACE Solver Description: Martin_J_Geiger
Parameterized Valiant's Classes
PACE Solver Description: CIMAT_Team
PACE Solver Description: ADE-Solver
An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem
Exact Complexity and Satisfiability - (Invited Talk)
The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups
Shortest Paths in Nearly Conservative Digraphs
Parameterized Maximum Node-Disjoint Paths
Boundaried Kernelization via Representative Sets
Exact Algorithms for Edge Domination
Instance Compression for the Polynomial Hierarchy and beyond
Finding and Counting Permutations via CSPs
Budgeted Matroid Maximization: a Parameterized Viewpoint
On the Hardness of Losing Width
New Algorithm for Combinatorial n-Folds and Applications
Cluster Editing with Overlapping Communities
Increasing the Minimum Degree of a Graph by Contractions
Improved Parameterized Algorithms for above Average Constraint Satisfaction
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
Faster Exact Algorithms for Some Terminal Set Problems
Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset
Unsplittable Flow on a Short Path
A Faster Algorithm for Dominating Set Analyzed by the Potential Method
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
A Polynomial Kernel for Paw-Free Editing
Recognizing Proper Tree-Graphs
Improved Induced Matchings in Sparse Graphs
A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set
What Makes Equitable Connected Partition Easy
FPT Algorithms for Consecutive Ones Submatrix Problems
PACE Solver Description: Computing Exact Treedepth via Minimal Separators
Parameterized Algorithms for Modular-Width
Parameterized Complexity of Streaming Diameter and Connectivity Problems
Dynamic Data Structures for Timed Automata Acceptance
Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers
Applying Modular Decomposition to Parameterized Bicluster Editing
An Exponential Time 2-Approximation Algorithm for Bandwidth
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
Computing Directed Pathwidth in O(1.89 n ) Time
The Parameterised Complexity Of Integer Multicommodity Flow
(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes
On Miniaturized Problems in Parameterized Complexity Theory
An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
Computing Generalized Convolutions Faster Than Brute Force
Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators
Parameterized Algorithms for Feedback Vertex Set
How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks
Optimal Centrality Computations Within Bounded Clique-Width Graphs
PACE Solver Description: Tree Depth with FlowCutter
Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set
Simplifying the Weft Hierarchy
Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than 3^k
Contracting Few Edges to Remove Forbidden Induced Subgraphs
Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder
An Exact Algorithm for the Minimum Dominating Clique Problem
Parameterized Complexities of Dominating and Independent Set Reconfiguration
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure
Approximate Monotone Local Search for Weighted Problems
A New Algorithm for Parameterized MAX-SAT
Definability Equals Recognizability for k-Outerplanar Graphs
Exploring the Kernelization Borders for Hitting Cycles
Upper Bounds on Boolean-Width with Applications to Exact Algorithms
Exponential Time Complexity of Weighted Counting of Independent Sets
On the Parameterized Complexity of Associative and Commutative Unification
Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number
Single Machine Scheduling with Few Deadlines
Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings
Approximate Turing Kernelization and Lower Bounds for Domination Problems
Parameterized Complexity of Geodetic Set
Hardness of Interval Scheduling on Unrelated Machines
The Path Taken for k-Path
Multistage Vertex Cover
Computing the Largest Bond of a Graph
On the Parameterized Complexity of d -Dimensional Point Set Pattern Matching
On the Complexity of Secluded Path Problems
On the Parameterized Complexity of Clique Elimination Distance
The Fine Details of Fast Dynamic Programming over Tree Decompositions
Hitting Geodesic Intervals in Structurally Restricted Graphs
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
On the Parameterized Complexity of Multiway Near-Separator
On Sparsification for Computing Treewidth
Some Definitorial Suggestions for Parameterized Proof Complexity
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
On the Parameterized Complexity of Reconfiguration Problems
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Smaller Parameters for Vertex Cover Kernelization
Computing Tree-Depth Faster Than 2 n
Determinant Sums for Hamiltonicity (Invited Talk)
On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings
Finding Degree-Constrained Acyclic Orientations
Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs
Solving Target Set Selection with Bounded Thresholds Faster than 2^n
Improved Kernels for Edge Modification Problems
Parameterized Complexity of Critical Node Cuts
Even Faster Algorithm for Set Splitting!
The Exponential Time Complexity of Computing the Probability That a Graph Is Connected
Dynamic Parameterized Problems
PACE Solver Description: Cluster Editing Kernelization Using CluES
The Dominating Set Problem in Geometric Intersection Graphs
PACE Solver Description: LUNCH - Linear Uncrossing Heuristics
An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization