Consistent query answering in databases
ACM SIGMOD Record
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Invitation to data reduction and problem kernelization
ACM SIGACT News
A logical approach to multicut problems
Information Processing Letters
Monadic datalog over finite structures with bounded treewidth
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The relative clique-width of a graph
Journal of Combinatorial Theory Series B
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG
Information Processing Letters
Parameterized complexity of the induced subgraph problem in directed graphs
Information Processing Letters
On the parameterized complexity of d-dimensional point set pattern matching
Information Processing Letters
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Journal of Computer and System Sciences
On the fixed-parameter tractability of parameterized model-checking problems
Information Processing Letters
Catalan structures and dynamic programming in H-minor-free graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of fixed-parameter problems: guest column
ACM SIGACT News
Infeasibility of instance compression and succinct PCPs for NP
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Tractable cases of the extended global cardinality constraint
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
The parameterized complexity of regular subgraph problems and generalizations
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Red-blue covering problems and the consecutive ones property
Journal of Discrete Algorithms
Data reduction and exact algorithms for clique cover
Journal of Experimental Algorithmics (JEA)
On the Positive--Negative Partial Set Cover problem
Information Processing Letters
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Parameterized Complexity and Logic
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Parameterized Learnability of k-Juntas and Related Problems
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Fixed-Parameter Algorithms for Kemeny Scores
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Minimum Leaf Out-Branching Problems
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Parameterized Computational Complexity of Dodgson and Young Elections
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Monadic Second Order Logic on Graphs with Local Cardinality Constraints
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Parameterized Graph Editing with Chosen Vertex Degrees
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Parameterized Algorithms for Generalized Domination
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Faster Steiner Tree Computation in Polynomial-Space
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Structural Tractability of Propagated Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
The minimum spanning strong subdigraph problem is fixed parameter tractable
Discrete Applied Mathematics
The parameterized complexity of probability amplification
Information Processing Letters
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics
The complexity of nonrepetitive coloring
Discrete Applied Mathematics
On tree width, bramble size, and expansion
Journal of Combinatorial Theory Series B
Towards Rule-Based Minimization of RDF Graphs under Constraints
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Parameterizing above or below guaranteed values
Journal of Computer and System Sciences
A quadratic kernel for feedback vertex set
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating fractional hypertree width
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A more effective linear kernelization for cluster editing
Theoretical Computer Science
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
A Most General Edge Elimination Polynomial
Graph-Theoretic Concepts in Computer Science
Parameterized Complexity for Domination Problems on Degenerate Graphs
Graph-Theoretic Concepts in Computer Science
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
Graph-Theoretic Concepts in Computer Science
Parameterized Graph Cleaning Problems
Graph-Theoretic Concepts in Computer Science
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Graph operations characterizing rank-width
Discrete Applied Mathematics
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
Discrete Applied Mathematics
Covering graphs with few complete bipartite subgraphs
Theoretical Computer Science
The Complexity of Predicting Atomicity Violations
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Finding, minimizing, and counting weighted subgraphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Linear kernelizations for restricted 3-Hitting Set problems
Information Processing Letters
Parameterized computational complexity of control problems in voting systems
Theoretical Computer Science
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
How similarity helps to efficiently compute Kemeny rankings
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
On Parameterized Exponential Time Complexity
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
Fixed-parameter evolutionary algorithms and the vertex cover problem
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Vertex fusion under distance constraints
European Journal of Combinatorics
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Incompressibility through Colors and IDs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Distortion Is Fixed Parameter Tractable
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Isolation concepts for efficiently enumerating dense subgraphs
Theoretical Computer Science
Graph-Based Data Clustering with Overlaps
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On Making Directed Graphs Transitive
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Parameterized graph cleaning problems
Discrete Applied Mathematics
A Practical Approach to Courcelle's Theorem
Electronic Notes in Theoretical Computer Science (ENTCS)
Lower Bounds for Kernelizations and Other Preprocessing Procedures
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Constant ratio fixed-parameter approximation of the edge multicut problem
Information Processing Letters
The Budgeted Unique Coverage Problem and Color-Coding
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
New Plain-Exponential Time Classes for Graph Homomorphism
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
A parameterized view on matroid optimization problems
Theoretical Computer Science
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Reduction rules deliver efficient FPT-algorithms for covering points with lines
Journal of Experimental Algorithmics (JEA)
Fixed-parameter algorithms for Kemeny rankings
Theoretical Computer Science
Minimum leaf out-branching and related problems
Theoretical Computer Science
On problems without polynomial kernels
Journal of Computer and System Sciences
Parameterized learnability of juntas
Theoretical Computer Science
Parameterized complexity of candidate control in elections and related digraph problems
Theoretical Computer Science
An extension of the bivariate chromatic polynomial
European Journal of Combinatorics
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms
Algorithms for propositional model counting
Journal of Discrete Algorithms
A note on width-parameterized SAT: An exact machine-model characterization
Information Processing Letters
Declarative specification and verification of service choreographiess
ACM Transactions on the Web (TWEB)
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
FPT algorithms and kernels for the Directedk- Leaf problem
Journal of Computer and System Sciences
A fixed-parameter tractable algorithm for spatio-temporal calendar management
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On notions of regularity for data languages
Theoretical Computer Science
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Finding Fullerene Patches in Polynomial Time
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A Kernel for Convex Recoloring of Weighted Forests
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Pursuing a fast robber on a graph
Theoretical Computer Science
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
A 4k2 kernel for feedback vertex set
ACM Transactions on Algorithms (TALG)
Treewidth computations I. Upper bounds
Information and Computation
Parameterized complexity of control problems in Maximin election
Information Processing Letters
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
Approximability and parameterized complexity of consecutive ones submatrix problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Kernelizations for parameterized counting problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Matched formulas and backdoor sets
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Backdoor sets of quantified boolean formulas
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Optimal edge deletions for signed graph balancing
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Graph operations characterizing rank-width and balanced graph expressions
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
On the complexity of some colorful problems parameterized by treewidth
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Problem kernels for NP-complete edge deletion problems: split and related graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Better algorithms and bounds for directed maximum leaf problems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Covering graphs with few complete bipartite subgraphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Capacitated domination and covering: a parameterized perspective
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A purely democratic characterization of W[1]
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Parameterized complexity and approximability of the SLCS problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
FPT algorithms for path-transversals and cycle-transversals problems in graphs
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A linear kernel for planar feedback vertex set
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Improved algorithms for bicluster editing
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Speeding up dynamic programming for some NP-hard graph recoloring problems
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Spanning trees with many leaves in graphs without diamonds and blossoms
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Probabilistic logic learning from haplotype data
Probabilistic inductive logic programming
Complexity of semi-stable and stage semantics in argumentation frameworks
Information Processing Letters
Note on Max Lin-2 above Average
Information Processing Letters
Optimal parameterized rectangular coverings
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Tree-width in Algebraic Complexity
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
An improved kernel size for rotation distance in binary trees
Information Processing Letters
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
Tree-width for first order formulae
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Decidable relationships between consistency notions for constraint satisfaction problems
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On the parameterised intractability of monadic second-order logic
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms
A kernelization algorithm for d-Hitting Set
Journal of Computer and System Sciences
Causal graphs and structurally restricted planning
Journal of Computer and System Sciences
Completing networks using observed data
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
There is no EPTAS for two-dimensional knapsack
Information Processing Letters
The parameterized complexity of editing graphs for bounded degeneracy
Theoretical Computer Science
Pure Nash equilibria: complete characterization of hard and easy graphical games
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
On agent types in coalition formation problems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
Note on maximal bisection above tight lower bound
Information Processing Letters
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
Journal of Computer and System Sciences
Betweenness parameterized above tight lower bound
Journal of Computer and System Sciences
Algorithms and Complexity Results for Persuasive Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
A benchmark diagnostic model generation system
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special issue on model-based diagnostics
Parameterized pursuit-evasion games
Theoretical Computer Science
Separator-based data reduction for signed graph balancing
Journal of Combinatorial Optimization
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithmic lower bounds for problems parameterized by clique-width
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Solving MAX-r-SAT above a tight lower bound
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Extended islands of tractability for parsimony haplotyping
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Monadic second order logic on graphs with local cardinality constraints
ACM Transactions on Computational Logic (TOCL)
A linear kernel for co-path/cycle packing
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
On p-optimal proof systems and logics for PTIME
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Parameterized modal satisfiability
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Resolving the complexity of some data privacy problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Minimum common string partition revisited
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Approximation algorithms for the capacitated domination problem
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Database theory: query languages
Algorithms and theory of computation handbook
Other complexity classes and measures
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Finding and counting vertex-colored subtrees
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Parameterized complexity and kernelizability of max ones and exact ones problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Does treewidth help in modal satisfiability?
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Faster approximation schemes and parameterized algorithms on H-minor-free and odd-minor-free graphs
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The curse of connectivity: t-total vertex (edge) cover
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Imbalance is fixed parameter tractable
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Efficient enumeration for conjunctive queries over x-underbar structures
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
On the number of spanning trees a planar graph can have
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Contractions of planar graphs in polynomial time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Infeasibility of instance compression and succinct PCPs for NP
Journal of Computer and System Sciences
Spanners of bounded degree graphs
Information Processing Letters
A probabilistic approach to problems parameterized above or below tight bounds
Journal of Computer and System Sciences
On the complexity of some colorful problems parameterized by treewidth
Information and Computation
The tree width of auxiliary storage
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The complexity of evaluating tuple generating dependencies
Proceedings of the 14th International Conference on Database Theory
Counting and enumeration problems with bounded treewidth
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Efficient algorithms for Eulerian extension
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Milling a graph with turn costs: a parameterized complexity perspective
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
On the Boolean-width of a graph: structure and applications
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A quartic kernel for pathwidth-one vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Parameterized complexity of the arc-preserving subsequence problem
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Complexity issues in vertex-colored graph pattern matching
Journal of Discrete Algorithms
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
Journal of Discrete Algorithms
On making a distinguished vertex minimum degree by vertex deletion
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics
Average parameterization and partial kernelization for computing medians
Journal of Computer and System Sciences
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
A logic for PTIME and a parameterized halting problem
Fields of logic and computation
Parameterized algorithms for the independent set problem in some hereditary graph classes
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Ranking and drawing in subexponential time
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Exploiting bounded signal flow for graph orientation based on cause-effect pairs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Incomplete information and certain answers in general data models
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finding a minimal tree pattern under neighborhood constraints
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Proceedings of the forty-third annual ACM symposium on Theory of computing
Finding topological subgraphs is fixed-parameter tractable
Proceedings of the forty-third annual ACM symposium on Theory of computing
Algorithms and complexity results for persuasive argumentation
Artificial Intelligence
Contracting planar graphs to contractions of triangulations
Journal of Discrete Algorithms
Breaking the 2n-barrier for Irredundance: Two lines of attack
Journal of Discrete Algorithms
Subexponential algorithms for partial cover problems
Information Processing Letters
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension
ACM Transactions on Algorithms (TALG)
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
Improved approximations for hard optimization problems via problem instance classification
Rainbow of computer science
Untestable properties in the kahr-moore-wang class
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Filling scaffolds with gene repetitions: maximizing the number of adjacencies
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Approximation algorithms for orienting mixed graphs
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
The parameterized complexity of chosen problems for finite automata on trees
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Satisfiability certificates verifiable in subexponential time
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Implicit branching and parameterized partial cover problems
Journal of Computer and System Sciences
Constraint satisfaction parameterized by solution size
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Parameterized bounded-depth Frege is not optimal
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Characterizing arithmetic circuit classes by constraint satisfaction problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Theoretical Computer Science
Exponential and polynomial time algorithms for the minimum common string partition problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Complexity of the stamp folding problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
On parameterized independent feedback vertex set
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Feedback vertex set in mixed graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Problems parameterized by treewidth tractable in single exponential time: a logical approach
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
The effect of homogeneity on the complexity of k-anonymity
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
A new bound for 3-satisfiable maxsat and its algorithmic application
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Isomorphism of (mis)labeled graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Paths, flowers and vertex cover
ESA'11 Proceedings of the 19th European conference on Algorithms
The parameterized complexity of local consistency
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Automata for monadic second-order model-checking
RP'11 Proceedings of the 5th international conference on Reachability problems
A kernel of order 2k-clogk for vertex cover
Information Processing Letters
Theoretical Computer Science
Dominating set is fixed parameter tractable in claw-free graphs
Theoretical Computer Science
Most probable explanations in Bayesian networks: Complexity and tractability
International Journal of Approximate Reasoning
On Bounded-Degree Vertex Deletion parameterized by treewidth
Discrete Applied Mathematics
Containment relations in split graphs
Discrete Applied Mathematics
Journal of Computer and System Sciences
Editing graphs to satisfy degree constraints: A parameterized approach
Journal of Computer and System Sciences
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing
SIAM Journal on Discrete Mathematics
ICDT'07 Proceedings of the 11th international conference on Database Theory
Database query processing using finite cursor machines
ICDT'07 Proceedings of the 11th international conference on Database Theory
Constraint satisfaction with bounded treewidth revisited
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Linear kernels for (connected) dominating set on H-minor-free graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Directed nowhere dense classes of graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Triangles, 4-cycles and parameterized (in-)tractability
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Parameterized complexity of finding small degree-constrained subgraphs
Journal of Discrete Algorithms
Parameterized Eulerian strong component arc deletion problem on tournaments
Information Processing Letters
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
Theoretical Computer Science
On making directed graphs transitive
Journal of Computer and System Sciences
Average parameterization and partial kernelization for computing medians
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Slightly superexponential parameterized problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Known algorithms on graphs of bounded treewidth are probably optimal
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fixed-parameter tractability results for feedback set problems in tournaments
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The linear arrangement problem parameterized above guaranteed value
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The complexity of geometric problems in high dimension
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Incremental list coloring of graphs, parameterized by conservation
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Two-Layer planarization parameterized by feedback edge set
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
On the hardness of losing weight
ACM Transactions on Algorithms (TALG)
Systems of linear equations over F2 and problems parameterized above average
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Fixed-Parameter algorithms for cochromatic number and disjoint rectangle stabbing
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Mod/Resc Parsimony Inference: Theory and application
Information and Computation
Hardness of discrepancy computation and ε-net verification in high dimension
Journal of Complexity
Parameterized complexity of generalized domination problems
Discrete Applied Mathematics
On the model-checking of monadic second-order formulas with edge set quantifications
Discrete Applied Mathematics
The parameterized complexity of maximality and minimality problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Randomized approximations of parameterized counting problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On parameterized approximability
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On the parameterized complexity of d-dimensional point set pattern matching
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Fixed-parameter tractability results for full-degree spanning tree and its dual
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
FPT algorithms for connected feedback vertex set
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Pathwidth and searching in parameterized threshold graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
A parameterized algorithm for chordal sandwich
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Multicut algorithms via tree decompositions
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Kernelization for maximum leaf spanning tree with positive vertex weights
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Algorithmic aspects of dominator colorings in graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
A new view on rural postman based on eulerian extension and matching
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Important separators and parameterized algorithms
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Complexity of splits reconstruction for low-degree trees
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Parameterized two-player nash equilibrium
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Planar k-path in subexponential time and polynomial space
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
From few components to an eulerian graph by adding arcs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
A polynomial time algorithm for bounded directed pathwidth
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Generalized above guarantee vertex cover and r-partization
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Parameterized algorithms for inclusion of linear matchings
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On the parameterized complexity of consensus clustering
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Parameterized complexity of the firefighter problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Minimum common string partition revisited
Journal of Combinatorial Optimization
Augmenting tractable fragments of abstract argumentation
Artificial Intelligence
Towards fixed-parameter tractable algorithms for abstract argumentation
Artificial Intelligence
Efficient approximations of conjunctive queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
The complexity of finding uniform sparsest cuts in various graph classes
Journal of Discrete Algorithms
Scaffold Filling under the Breakpoint and Related Distances
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Improved parameterized algorithms for above average constraint satisfaction
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Kernel bounds for path and cycle problems
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Parameterized maximum path coloring
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On the parameterized complexity of default logic and autoepistemic logic
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Patterns with bounded treewidth
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Catalan structures and dynamic programming in H-minor-free graphs
Journal of Computer and System Sciences
Parameterized complexity of maxsat above average
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
New lower bound on max cut of hypergraphs with an application to r-set splitting
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Counting crossing-free structures
Proceedings of the twenty-eighth annual symposium on Computational geometry
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Augmenting tractable fragments of abstract argumentation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Searching the k-change neighborhood for TSP is W[1]-hard
Operations Research Letters
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
Book review: Invitation to fixed-parameter algorithms
Computer Science Review
Survey: Subexponential parameterized algorithms
Computer Science Review
FPT algorithms for path-transversal and cycle-transversal problems
Discrete Optimization
Discrete Optimization
The parameterized complexity of k-flip local search for SAT and MAX SAT
Discrete Optimization
On the algorithmic effectiveness of digraph decompositions and complexity measures
Discrete Optimization
Stable assignment with couples: Parameterized complexity and local search
Discrete Optimization
Graph-based data clustering with overlaps
Discrete Optimization
Parameterized complexity and approximability of the Longest Compatible Sequence problem
Discrete Optimization
Paths of bounded length and their cuts: Parameterized complexity and algorithms
Discrete Optimization
A parameterized runtime analysis of evolutionary algorithms for MAX-2-SAT
Proceedings of the 14th annual conference on Genetic and evolutionary computation
On the evaluation of election outcomes under uncertainty
Artificial Intelligence
FPT algorithms for Connected Feedback Vertex Set
Journal of Combinatorial Optimization
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem
Journal of the ACM (JACM)
Kernels for packing and covering problems
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Fixed-Parameter tractability of almost CSP problem with decisive relations
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Constraint optimization problems and bounded tree-width revisited
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Query strategies for evading convex-inducing classifiers
The Journal of Machine Learning Research
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
Kernelization --- preprocessing with a guarantee
The Multivariate Algorithmic Revolution and Beyond
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Kernel(s) for problems with no kernel: On out-trees with many leaves
ACM Transactions on Algorithms (TALG)
Cluster editing with locally bounded modifications
Discrete Applied Mathematics
Communication: Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width
Discrete Applied Mathematics
Strong backdoors to nested satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Parameterized complexity of weighted satisfiability problems
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Fixed-parameter tractability of satisfying beyond the number of variables
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Finding a Periodic Attractor of a Boolean Network
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Parameterized Bounded-Depth Frege Is not Optimal
ACM Transactions on Computation Theory (TOCT)
Directed subset feedback vertex set is fixed-parameter tractable
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized approximation via fidelity preserving transformations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
The parameterized complexity of k-edge induced subgraphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized tractability of multiway cut with parity constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
First-Order and Monadic Second-Order Model-Checking on Ordered Structures
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Minimizing rosenthal potential in multicast games
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A new view on Rural Postman based on Eulerian Extension and Matching
Journal of Discrete Algorithms
Confluence in data reduction: bridging graph transformation and kernelization
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
A linear kernel for the complementary maximal strip recovery problem
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Faster parameterized algorithms for deletion to split graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
A single-exponential FPT algorithm for the K4- minor cover problem
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
A fast algorithm for permutation pattern matching based on alternating runs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Sum-Max graph partitioning problem
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Exploiting a hypergraph model for finding golomb rulers
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
New races in parameterized algorithmics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Parameterized study of the test cover problem
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the parameterized complexity of the workflow satisfiability problem
Proceedings of the 2012 ACM conference on Computer and communications security
Exact combinatorial algorithms and experiments for finding maximum k-plexes
Journal of Combinatorial Optimization
On Parameterized Independent Feedback Vertex Set
Theoretical Computer Science
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
ACM Transactions on Algorithms (TALG)
On notions of regularity for data languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Efficient parameterized preprocessing for cluster editing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Subexponential time and fixed-parameter tractability: exploiting the miniaturization mapping
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Subexponential parameterized algorithms
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Parameterized algorithms for directed maximum leaf problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Parameterized approximability of the disjoint cycle problem
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Model theory makes formulas large
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Connected coloring completion for general graphs: algorithms and complexity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Quadratic kernelization for convex recoloring of trees
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Fixed-parameter tractability for non-crossing spanning trees
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Completely inapproximable monotone and antimonotone parameterized problems
Journal of Computer and System Sciences
A polynomial kernel for proper interval vertex deletion
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
FPT algorithms for domination in biclique-free graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
European Journal of Combinatorics
The exponential time hypothesis and the parameterized clique problem
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Restricted and swap common superstring: a parameterized view
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Some definitorial suggestions for parameterized proof complexity
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Instance compression for the polynomial hierarchy and beyond
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
On the space complexity of parameterized problems
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Parameterized algorithmics and computational experiments for finding 2-clubs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
A practical approximation algorithm for solving massive instances of hybridization number
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Parameterized algorithms for even cycle transversal
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Parameterized domination in circle graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Communications of the ACM
(Non-)existence of polynomial kernels for the Test Cover problem
Information Processing Letters
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Theoretical Computer Science
Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms
Information Processing Letters
Complex analogies: remarks on the complexity of HDTP
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Constant thresholds can make target set selection tractable
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Extracting minimum-weight tree patterns from a schema with neighborhood constraints
Proceedings of the 16th International Conference on Database Theory
New results on maximum induced matchings in bipartite graphs and beyond
Theoretical Computer Science
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science
On multiway cut parameterized above lower bounds
ACM Transactions on Computation Theory (TOCT)
The fine classification of conjunctive queries and parameterized logarithmic space complexity
Proceedings of the 32nd symposium on Principles of database systems
Approximation algorithms for orienting mixed graphs
Theoretical Computer Science
A trichotomy for regular simple path queries on graphs
Proceedings of the 32nd symposium on Principles of database systems
On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem
ACM Transactions on Information and System Security (TISSEC)
Large-treewidth graph decompositions and applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Distortion is Fixed Parameter Tractable
ACM Transactions on Computation Theory (TOCT)
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science
Two-Layer Planarization parameterized by feedback edge set
Theoretical Computer Science
Testing first-order properties for subclasses of sparse graphs
Journal of the ACM (JACM)
Does Treewidth Help in Modal Satisfiability?
ACM Transactions on Computational Logic (TOCL)
Parameterized Complexity of DPLL Search Procedures
ACM Transactions on Computational Logic (TOCL)
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
Finding optimal Bayesian networks using precedence constraints
The Journal of Machine Learning Research
Parameterized complexity results for exact bayesian network structure learning
Journal of Artificial Intelligence Research
Parameterized algorithms for generalized traveling salesman problems in road networks
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Upper and lower bounds for weak backdoor set detection
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Counting matchings of size k is # W[1]-hard
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Fixed-Parameter algorithms for minimum cost edge-connectivity augmentation
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A refined complexity analysis of degree anonymization in graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Imbalance is fixed parameter tractable
Information Processing Letters
Parameterized complexity of 1-planarity
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Bounding the running time of algorithms for scheduling and packing problems
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
When is weighted satisfiability FPT?
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
On the complexity of finding a largest common subtree of bounded degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
When almost is not even close: remarks on the approximability of HDTP
AGI'13 Proceedings of the 6th international conference on Artificial General Intelligence
A note on tractability and artificial intelligence
AGI'13 Proceedings of the 6th international conference on Artificial General Intelligence
Parameterized complexity of connected even/odd subgraph problems
Journal of Computer and System Sciences
Lower bounds on the complexity of MSO1 model-checking
Journal of Computer and System Sciences
Effective computation of immersion obstructions for unions of graph classes
Journal of Computer and System Sciences
The complexity of weighted counting for acyclic conjunctive queries
Journal of Computer and System Sciences
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
Making queries tractable on big data with preprocessing: through the eyes of complexity theory
Proceedings of the VLDB Endowment
Are there any nicely structured preference profiles nearby?
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Fully proportional representation as resource allocation: approximability results
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
On the complexity of global scheduling constraints under structural restrictions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Parameterized complexity of optimal planning: a detailed map
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs
ACM Transactions on Knowledge Discovery from Data (TKDD)
Information and Computation
A new bound for 3-satisfiable MaxSat and its algorithmic application
Information and Computation
Black-box obfuscation for d-CNFs
Proceedings of the 5th conference on Innovations in theoretical computer science
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets
Journal of Automated Reasoning
On the complexity of existential positive queries
ACM Transactions on Computational Logic (TOCL)
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Theory of Computing Systems
The effect of homogeneity on the computational complexity of combinatorial data anonymization
Data Mining and Knowledge Discovery
Clique-width and edge contraction
Information Processing Letters
Discrete Applied Mathematics
Preprocessing subgraph and minor problems: When does a small vertex cover help?
Journal of Computer and System Sciences
Parameterized maximum path coloring
Theoretical Computer Science
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Theoretical Computer Science
Parameterized complexity of MaxSat Above Average
Theoretical Computer Science
Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game
Theoretical Computer Science
Note: Parameterized complexity of k-Chinese Postman Problem
Theoretical Computer Science
Maximum balanced subgraph problem parameterized above lower bound
Theoretical Computer Science
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Information and Computation
On the computation of fully proportional representation
Journal of Artificial Intelligence Research
A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
Journal of Artificial Intelligence Research
Complexity results for rainbow matchings
Theoretical Computer Science
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach
Journal of Computer and System Sciences
Radiation hybrid map construction problem parameterized
Journal of Combinatorial Optimization
Parameterized Domination in Circle Graphs
Theory of Computing Systems
Annals of Mathematics and Artificial Intelligence
The complexity of optimal monotonic planning: the bad, the good, and the causal graph
Journal of Artificial Intelligence Research
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
The complexity of register allocation
Discrete Applied Mathematics
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics
Towards optimal kernel for edge-disjoint triangle packing
Information Processing Letters
| Hi-index | 0.05 |