STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Fast algorithms for constructing optimal trees from quartets
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Linear-time register allocation for a fixed number of registers
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The parameterized complexity of database queries
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Information Processing Letters
Parameterized complexity for the database theorist
ACM SIGMOD Record
Parameterized complexity of finding subgraphs with hereditary properties
Theoretical Computer Science
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Analogs and Duals of teh MAST Problem for Sequences and Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Preprocessing of intractable problems
Information and Computation
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
Theoretical Computer Science
Parameterized complexity of vertex colouring
Discrete Applied Mathematics
The turing way to parameterized complexity
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Solving large FPT problems on coarse-grained parallel machines
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
On the complexity of fixed parameter clique and dominating set
Theoretical Computer Science
Refined memorization for vertex cover
Information Processing Letters
Two algorithms for general list matrix partitions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The intractability of computing the Hamming distance
Theoretical Computer Science
Chordless paths through three vertices
Theoretical Computer Science - Parameterized and exact computation
Finding and counting cliques and independent sets in r-uniform hypergraphs
Information Processing Letters
Backdoor Sets for DLL Subsolvers
Journal of Automated Reasoning
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Open problems around exact algorithms
Discrete Applied Mathematics
The complexity of fixed-parameter problems: guest column
ACM SIGACT News
A fixed-parameter algorithm for the directed feedback vertex set problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Efficient algorithms for counting parameterized list H-colorings
Journal of Computer and System Sciences
Structural Tractability of Propagated Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
A heuristic approach for the max-min diversity problem based on max-clique
Computers and Operations Research
Formal Methods in System Design
Parameterized Complexity for Domination Problems on Degenerate Graphs
Graph-Theoretic Concepts in Computer Science
Approximability and Parameterized Complexity of Minmax Values
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms
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
Enumeration of isolated cliques and pseudo-cliques
ACM Transactions on Algorithms (TALG)
On notions of regularity for data languages
Theoretical Computer Science
Refined memorization for vertex cover
Information Processing Letters
Bounded tree-width and CSP-related problems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A purely democratic characterization of W[1]
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
Causal graphs and structurally restricted planning
Journal of Computer and System Sciences
There is no EPTAS for two-dimensional knapsack
Information Processing Letters
Algorithms and theory of computation handbook
Exponential propagation for set variables
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science
Parameterized complexity of k-anonymity: hardness and tractability
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Improved approximations for hard optimization problems via problem instance classification
Rainbow of computer science
Cliques with maximum/minimum edge neighborhood and neighborhood density
Computers and Operations Research
Kernel bounds for disjoint cycles and disjoint paths
Theoretical Computer Science
Algorithms for testing monomials in multivariate polynomials
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Parameterized complexity in multiple-interval graphs: partition, separation, irredundancy
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
On the complexity of the l-diversity problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Contracting a chordal graph to a split graph or a tree
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
The parameterized complexity of local consistency
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
Theoretical Computer Science
On bounded block decomposition problems for under-specified systems of equations
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Linear-time enumeration of isolated cliques
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A structural/temporal query language for Business Processes
Journal of Computer and System Sciences
Finding the smallest H-Subgraph in real weighted graphs and related problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
ACM Transactions on Algorithms (TALG)
Parameterized complexity of generalized domination problems
Discrete Applied Mathematics
Applying modular decomposition to parameterized bicluster editing
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
Parameterized complexity in multiple-interval graphs: domination
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
Book review: Invitation to fixed-parameter algorithms
Computer Science Review
Discrete Optimization
W[2]-hardness of precedence constrained K-processor scheduling
Operations Research Letters
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
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Streaming and communication complexity of clique approximation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Counting homomorphisms via hypergraph-based structural restrictions
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
The robust set problem: parameterized complexity and approximation
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Theoretical Computer Science
Testing first-order properties for subclasses of sparse graphs
Journal of the ACM (JACM)
Parameterized complexity of k-anonymity: hardness and tractability
Journal of Combinatorial Optimization
Generating informative snippet to maximize item visibility
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Parameterized complexity results for exact bayesian network structure learning
Journal of Artificial Intelligence Research
On testing monomials in multivariate polynomials
Theoretical Computer Science
Cliques in odd-minor-free graphs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
A dynamic data structure for counting subgraphs in sparse graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
The l-Diversity problem: Tractability and approximability
Theoretical Computer Science
Distance-$$d$$ independent set problems for bipartite and chordal graphs
Journal of Combinatorial Optimization
The density maximization problem in graphs
Journal of Combinatorial Optimization
| Hi-index | 5.24 |