The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the completeness of a generalized matching problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the complexity of the Maximum Subgraph Problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The recognition of Series Parallel digraphs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A generalized algorithm for centrality problems on trees
Journal of the ACM (JACM)
Dynamic expression trees and their applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Distributed Predicate Detection in Series-Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
Scheduling under uncertainty: bounding the makespan distribution
Computational Discrete Mathematics
Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Algorithms for the Multicolorings of Partial k-Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Iterative-free program analysis
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Efficiently parallelizable problems on a class of decomposable graphs
Journal of Computer and System Sciences
Tree-edges deletion problems with bounded diameter obstruction sets
Discrete Applied Mathematics
Real-time minimum vertex cover for two-terminal series-parallel graphs
International Journal of High Performance Computing and Networking
A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Science of Computer Programming
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Approximability of partitioning graphs with supply and demand
Journal of Discrete Algorithms
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
Partitioning graphs of supply and demand
Discrete Applied Mathematics
Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Jump number maximization for proper interval graphs and series-parallel graphs
Information Sciences: an International Journal
The SPQR-tree data structure in graph drawing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Recognition of directed acyclic graphs by spanning tree automata
Theoretical Computer Science
Minimum dominating set approximation in graphs of bounded arboricity
DISC'10 Proceedings of the 24th international conference on Distributed computing
Partitioning a multi-weighted graph to connected subgraphs of almost uniform size
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Orthogonal drawings of series-parallel graphs with minimum bends
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Polynomial time inductive inference of TTSP graph languages from positive data
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Partitioning a weighted graph to connected subgraphs of almost uniform size
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Scheduling for heterogeneous Systems using constrained critical paths
Parallel Computing
Approximability of partitioning graphs with supply and demand
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Small grid drawings of planar graphs with balanced bipartition
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
The quadratic 0-1 knapsack problem with series-parallel support
Operations Research Letters
Small grid drawings of planar graphs with balanced partition
Journal of Combinatorial Optimization
Algorithms for bandwidth consecutive multicolorings of graphs
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
Series-Parallel Automata and Short Regular Expressions
Fundamenta Informaticae
Quadratic bottleneck knapsack problems
Journal of Heuristics
| Hi-index | 0.01 |