The complexity of the Kn,n-problem for node replacement graph languages
Information and Computation
On the design of efficient ATM routing schemes
Theoretical Computer Science
Approximation of pathwidth of outerplanar graphs
Journal of Algorithms
Easy Cases of Probabilistic Satisfiability
Annals of Mathematics and Artificial Intelligence
Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs
Discrete Mathematics
Embedding k-outerplanar graphs into ℓ1
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Call Control with k Rejections
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Deciding Clique-Width for Graphs of Bounded Tree-Width
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
An Improved Algorithm for Finding Tree Decompositions of Small Width
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Small k-Dominating Sets in Planar Graphs with Applications
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximation of Pathwidth of Outerplanar Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Graph Separator Algorithms: A Refined Analysis
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Safe Reduction Rules for Weighted Treewidth
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Theoretical Computer Science
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
Theoretical Computer Science
Signal Processing - From signal processing theory to implementation
Interval degree and bandwidth of a graph
Discrete Applied Mathematics
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Annals of Mathematics and Artificial Intelligence
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Call control with k rejections
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Graph separators: a parameterized view
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The complexity of counting homomorphisms seen from the other side
Theoretical Computer Science
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
Degree-constrained decompositions of graphs: bounded treewidth and planarity
Theoretical Computer Science
On finding short resolution refutations and small unsatisfiable subsets
Theoretical Computer Science - Parameterized and exact computation
ACM Transactions on Algorithms (TALG)
Counting models for 2SAT and 3SAT formulae
Theoretical Computer Science
Exact algorithms and applications for Tree-like Weighted Set Cover
Journal of Discrete Algorithms
A 3-approximation for the pathwidth of Halin graphs
Journal of Discrete Algorithms
Conjunctive query evaluation by search-tree revisited
Theoretical Computer Science
The Embedding Problem for Switching Classes of Graphs
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Achievable sets, brambles, and sparse treewidth obstructions
Discrete Applied Mathematics
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science
Algorithms for finding distance-edge-colorings of graphs
Journal of Discrete Algorithms
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Universal augmentation schemes for network navigability: overcoming the √n-barrier
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
On exact algorithms for treewidth
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
The relative clique-width of a graph
Journal of Combinatorial Theory Series B
Graph drawings with few slopes
Computational Geometry: Theory and Applications
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Vertex-minor reductions can simulate edge contractions
Discrete Applied Mathematics
Lower bounds on the pathwidth of some grid-like graphs
Discrete Applied Mathematics
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Improved upper bounds on the crossing number
Proceedings of the twenty-fourth annual symposium on Computational geometry
The Maximum Independent Set Problem in Planar Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Monadic Second Order Logic on Graphs with Local Cardinality Constraints
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Faster Steiner Tree Computation in Polynomial-Space
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Monotony properties of connected visible graph searching
Information and Computation
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The Valve Location Problem in Simple Network Topologies
Graph-Theoretic Concepts in Computer Science
Graph-Theoretic Concepts in Computer Science
Digraph Decompositions and Monotonicity in Digraph Searching
Graph-Theoretic Concepts in Computer Science
Complexity results for minimum sum edge coloring
Discrete Applied Mathematics
Derivation of algorithms for cutwidth and related graph layout parameters
Journal of Computer and System Sciences
European Journal of Combinatorics
Universal augmentation schemes for network navigability
Theoretical Computer Science
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry: Theory and Applications
Algorithms for graphs of bounded treewidth via orthogonal range searching
Computational Geometry: Theory and Applications
Triangulation Heuristics for BN2O Networks
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Computing the Girth of a Planar Graph in O(n logn) Time
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Computing Bond Types in Molecule Graphs
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On problems without polynomial kernels
Journal of Computer and System Sciences
On the complexity of some subgraph problems
Discrete Applied Mathematics
ACM Transactions on Algorithms (TALG)
Journal of Discrete Algorithms
Constraint satisfaction with bounded treewidth revisited
Journal of Computer and System Sciences
Local search: is brute-force avoidable?
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Local search: is brute-force avoidable?
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Optimization for first order Delaunay triangulations
Computational Geometry: Theory and Applications
Covering a Graph with a Constrained Forest (Extended Abstract)
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Pursuing a fast robber on a graph
Theoretical Computer Science
minimum dominating set of queens: A trivial programming exercise?
Discrete Applied Mathematics
Treewidth computations I. Upper bounds
Information and Computation
Independence polynomials of k-tree related graphs
Discrete Applied Mathematics
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Characterizing minimal interval completions towards better understanding of profile and pathwidth
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Complexity and approximation results for the connected vertex cover problem
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Pathwidth of circular-arc graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Determining the smallest k such that G is k-outerplanar
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Weighted treewidth algorithmic techniques and results
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
European Journal of Combinatorics
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing
Efficient frequent connected subgraph mining in graphs of bounded tree-width
Theoretical Computer Science
Finding shortest non-trivial cycles in directed graphs on surfaces
Proceedings of the twenty-sixth annual symposium on Computational geometry
The Valve Location Problem in Simple Network Topologies
INFORMS Journal on Computing
Discrete Applied Mathematics
Recognition of directed acyclic graphs by spanning tree automata
Theoretical Computer Science
Frequent subgraph mining in outerplanar graphs
Data Mining and Knowledge Discovery
Tractability in Value-based Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Monadic second order logic on graphs with local cardinality constraints
ACM Transactions on Computational Logic (TOCL)
On monadic second-order theories of multidominance structures
MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
On graph thickness, geometric thickness, and separator theorems
Computational Geometry: Theory and Applications
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Complexity results for the spanning tree congestion problem
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
Computing bond orders in molecule graphs
Theoretical Computer Science
A local search algorithm for branchwidth
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Computing the Girth of a Planar Graph in $O(n \logn)$ Time
SIAM Journal on Discrete Mathematics
Monadic second-order model-checking on decomposable matroids
Discrete Applied Mathematics
Treewidth computations II. Lower bounds
Information and Computation
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
Quantum Information Processing
Complexity and approximation of the Constrained Forest problem
Theoretical Computer Science
How to cut a graph into many pieces
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Digraph decompositions and monotonicity in digraph searching
Theoretical Computer Science
Quantum Information & Computation
Graphs of bounded treewidth can be canonized in AC1
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Satisfiability of acyclic and almost acyclic CNF formulas (II)
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
Computing the girth of a planar graph in linear time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Pre-processing for triangulation of probabilistic networks
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
On Bounded-Degree Vertex Deletion parameterized by treewidth
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
Constraint satisfaction with bounded treewidth revisited
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Linear kernels for (connected) dominating set on H-minor-free graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximate tree decompositions of planar graphs in linear time
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
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
Discrete Applied Mathematics
Algorithms for finding distance-edge-colorings of graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
European Journal of Combinatorics
Sharp separation and applications to exact and parameterized algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Conjunctive query evaluation by search tree revisited
ICDT'05 Proceedings of the 10th international conference on Database Theory
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Embedding bounded bandwidth graphs into ℓ1
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Really straight graph drawings
GD'04 Proceedings of the 12th international conference on Graph Drawing
Nondeterministic graph searching: from pathwidth to treewidth
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Cyclic pattern kernels revisited
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Induced subgraphs of bounded degree and bounded treewidth
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Computing branchwidth via efficient triangulations and blocks
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Minimum sum multicoloring on the edges of planar graphs and partial k-trees
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Exact algorithms for graph homomorphisms
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Degree-Based treewidth lower bounds
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
New upper bound heuristics for treewidth
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Local search: Is brute-force avoidable?
Journal of Computer and System Sciences
The complexity of minimum convex coloring
Discrete Applied Mathematics
Solving #SAT using vertex covers
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
On switching classes, NLC-width, cliquewidth and treewidth
Theoretical Computer Science
Note: A note on planar graphs with large width parameters and small grid-minors
Discrete Applied Mathematics
Branching and treewidth based exact algorithms
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On the minimum corridor connection problem and other generalized geometric problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Polynomial space algorithms for counting dominating sets and the domatic number
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
The branch-width of circular-arc graphs
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
On the bend-number of planar and outerplanar graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Charge group partitioning in biomolecular simulation
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
SDD: a new canonical representation of propositional knowledge bases
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Tree decompositions of graphs: Saving memory in dynamic programming
Discrete Optimization
Scheduling of pipelined operator graphs
Journal of Scheduling
Restricted space algorithms for isomorphism on bounded treewidth graphs
Information and Computation
Some remarks on the incompressibility of width-parameterized SAT instances
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 treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
k-chordal graphs: from cops and robber to compact routing via treewidth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A single-exponential FPT algorithm for the K4- minor cover problem
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Kernel bounds for structural parameterizations of pathwidth
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
The robust set problem: parameterized complexity and approximation
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
The Embedding Problem for Switching Classes of Graphs
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
2K2-partition of some classes of graphs
Discrete Applied Mathematics
On exact algorithms for treewidth
ACM Transactions on Algorithms (TALG)
Optimization for first order delaunay triangulations
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Entanglement and the complexity of directed graphs
Theoretical Computer Science
Approximate search strategies for weighted trees
Theoretical Computer Science
A bijective code for k-trees with linear time encoding and decoding
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
European Journal of Combinatorics
Probabilistic inference and monadic second order logic
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
h-quasi planar drawings of bounded treewidth graphs in linear area
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Coalition structure generation over graphs
Journal of Artificial Intelligence Research
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science
Proceedings of the twenty-ninth annual symposium on Computational geometry
The fine classification of conjunctive queries and parameterized logarithmic space complexity
Proceedings of the 32nd symposium on Principles of database systems
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Characterizing graphs of small carving-width
Discrete Applied Mathematics
Tight bounds for low dimensional star stencils in the external memory model
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Lower bounds for treewidth of product graphs
Discrete Applied Mathematics
Preprocessing subgraph and minor problems: When does a small vertex cover help?
Journal of Computer and System Sciences
On computational complexity of graph inference from counting
Natural Computing: an international journal
Obstructions for linear rank-width at most 1
Discrete Applied Mathematics
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics
| Hi-index | 5.25 |