The vertex separation and search number of a graph
Information and Computation
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Finding maximum independent sets in sparse and general graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
What are the least tractable instances of max independent set?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
New spectral lower bounds on the bisection width of graphs
Theoretical Computer Science
A new approach to proving upper bounds for MAX-2-SAT
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Algorithms based on the treewidth of sparse graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Exact (exponential) algorithms for the dominating set problem
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A new approach to proving upper bounds for MAX-2-SAT
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Exponential time algorithms for the minimum dominating set problem on some graph classes
ACM Transactions on Algorithms (TALG)
An O*(1.0977n) exact algorithm for MAX INDEPENDENT SET in sparse graphs
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Colorings with few colors: counting, enumeration and combinatorial bounds
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Exact and parameterized algorithms for edge dominating set in 3-degree graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Further improvement on maximum independent set in degree-4 graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Improved edge-coloring with three colors
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Maximum independent set in graphs of average degree at most three in O(1.08537n)
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Branching and treewidth based exact algorithms
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Exact algorithms for finding the minimum independent dominating set in graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A simple and fast algorithm for maximum independent set in 3-degree graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Counting maximal independent sets in subcubic graphs
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Improved worst-case complexity for the MIN 3-SET COVERING problem
Operations Research Letters
Linear-programming design and analysis of fast algorithms for Max 2-CSP
Discrete Optimization
Improved exact algorithms for counting 3- and 4-colorings
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Efficient algorithms for the max k-vertex cover problem
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Theoretical Computer Science
| Hi-index | 0.89 |
We prove that for any @?0 there exists an integer n"@? such that the pathwidth of every cubic (or 3-regular) graph on nn"@? vertices is at most (1/6+@?)n. Based on this bound we improve the worst case time analysis for a number of exact exponential algorithms on graphs of maximum vertex degree three.