Optimal edge ranking of trees in linear time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Listing all potential maximal cliques of a graph
Theoretical Computer Science
A survey of graph layout problems
ACM Computing Surveys (CSUR)
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Listing All Potential Maximal Cliques of a Graph
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximating the Treewidth of AT-Free Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximating the treewidth of AT-free graphs
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Theoretical Computer Science - Latin American theorotical informatics
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)
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
MUP: a minimal unsatisfiability prover
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Edge ranking of weighted trees
Discrete Applied Mathematics
Header-size lower bounds for end-to-end communication in memoryless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Tree-depth, subgraph coloring and homomorphism bounds
European Journal of Combinatorics
Vertex rankings of chordal graphs and weighted trees
Information Processing Letters
Constructing a minimum height elimination tree of a tree in linear time
Information Sciences: an International Journal
Digraph measures: Kelly decompositions, games, and orderings
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Digraph measures: Kelly decompositions, games, and orderings
Theoretical Computer Science
Exact Max 2-Sat: Easier and Faster
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Approximation Algorithms and Hardness for Domination with Propagation
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating fractional hypertree width
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
On balanced CSPs with high treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Exponential time algorithms for the minimum dominating set problem on some graph classes
ACM Transactions on Algorithms (TALG)
Reconfiguration of the routing in WDM networks with two classes of services
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
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)
Approximating the treewidth of AT-free graphs
Discrete Applied Mathematics
Edge ranking of weighted trees
Discrete Applied Mathematics
Vertex rankings of chordal graphs and weighted trees
Information Processing Letters
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
Treewidth computations I. Upper bounds
Information and Computation
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
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
Algorithms and theory of computation handbook
Grammar factorization by tree decomposition
Computational Linguistics
Graph unique-maximum and conflict-free colorings
Journal of Discrete Algorithms
Efficient approximation for triangulation of minimum treewidth
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Greedy routing in tree-decomposed graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Minimizing nLC-width is nP-complete
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Ordered coloring grids and related graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Graph unique-maximum and conflict-free colorings
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Ordered coloring of grids and related graphs
Theoretical Computer Science
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Information and Computation
Approximate search strategies for weighted trees
Theoretical Computer Science
On tractable parameterizations of graph isomorphism
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Finding the edge ranking number through vertex partitions
Discrete Applied Mathematics
Lower bounds for treewidth of product graphs
Discrete Applied Mathematics
On the tree-depth of random graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |