Arboricity and subgraph listing algorithms
SIAM Journal on Computing
Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
Linear-time computation of optimal subgraphs of decomposable graphs
Journal of Algorithms
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
Subgraph isomorphism for biconnected outerplanar graphs in cubic time
Theoretical Computer Science
Efficient message routing in planar networks
SIAM Journal on Computing
Space-efficient message routing in c-decomposable networks
SIAM Journal on Computing
Connectivity of plane triangulations
Information Processing Letters
Planar orientations with low out-degree and compaction of adjacency matrices
Theoretical Computer Science
Finding minimally weighted subgraphs
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
SIAM Journal on Computing
A linear-time algorithm for testing the inscribability of trivalent polyhedra
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On linear time minor tests with depth-first search
Journal of Algorithms
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Connectivity, graph minors, and subgraph multiplicity
Journal of Graph Theory
Arboricity and bipartite subgraph listing algorithms
Information Processing Letters
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Linear-time computability of combinatorial problems on series-parallel graphs
Journal of the ACM (JACM)
A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
On approximating a vertex cover for planar graphs
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Information and Computation
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Computing the Girth of a Planar Graph
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Interpreting Sloppy Stick Figures with Constraint-Based Subgraph Matching
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
SODA '04 Proceedings of the fifteenth 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
Linear time low tree-width partitions and algorithmic consequences
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Grad and classes with bounded expansion II. Algorithmic aspects
European Journal of Combinatorics
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
On problems without polynomial kernels
Journal of Computer and System Sciences
Identification of design motifs with pattern matching algorithms
Information and Software Technology
Improving design-pattern identification: a new approach and an exploratory study
Software Quality Control
Workflow abstraction for privacy preservation
WISE'07 Proceedings of the 2007 international conference on Web information systems engineering
A faster algorithm for computing the girth of planar and bounded genus graphs
ACM Transactions on Algorithms (TALG)
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
The density maximization problem in graphs
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Guard games on graphs: Keep the intruder out!
Theoretical Computer Science
Dynamic software birthmark for java based on heap memory analysis
CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
Knowledge hiding from tree and graph databases
Data & Knowledge Engineering
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth
GD'04 Proceedings of the 12th international conference on Graph Drawing
Guard games on graphs: keep the intruder out!
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research
An efficient genetic algorithm for subgraph isomorphism
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Finding patterns in an unknown graph
AI Communications - The Symposium on Combinatorial Search
ClouDiA: a deployment advisor for public clouds
Proceedings of the VLDB Endowment
Testing first-order properties for subclasses of sparse graphs
Journal of the ACM (JACM)
Approximating the diameter of planar graphs in near linear time
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
The density maximization problem in graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |