Forests, frames, and games: algorithms for matroid sums and applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
A (usually?) connected subgraph of the minimum weight triangulation
Proceedings of the twelfth annual symposium on Computational geometry
On floorplans of planar graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Drawing planar partitions I: LL-drawings and LH-drawings
Proceedings of the fourteenth annual symposium on Computational geometry
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A better approximation algorithm for finding planar subgraphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Approximation for minimum triangulation of convex polyhedra
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Fast recognition algorithms for classes of partial cubes
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
All maximal independent sets and dynamic dominance for sparse graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Curve-constrained drawings of planar graphs
Computational Geometry: Theory and Applications
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
Computational Geometry: Theory and Applications
Oracles for bounded-length shortest paths in planar graphs
ACM Transactions on Algorithms (TALG)
The worst-case time complexity for generating all maximal cliques and computational experiments
Theoretical Computer Science - Computing and combinatorics
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
Theoretical Computer Science
Detectives: detecting coalition hit inflation attacks in advertising networks streams
Proceedings of the 16th international conference on World Wide Web
From graphs to Euclidean virtual worlds: visualization of 3D electronic institutions
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Main-memory triangle computations for very large (sparse (power-law)) graphs
Theoretical Computer Science
Octagonal drawings of plane graphs with prescribed face areas
Computational Geometry: Theory and Applications
A scalable, parallel algorithm for maximal clique enumeration
Journal of Parallel and Distributed Computing
Finding, minimizing, and counting weighted subgraphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
All maximal independent sets and dynamic dominance for sparse graphs
ACM Transactions on Algorithms (TALG)
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Path consistency on triangulated constraint graphs
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
Computational Geometry: Theory and Applications
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Fast recognition algorithms for classes of partial cubes
Discrete Applied Mathematics
Biclique edge cover graphs and confluent drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
Theoretical Computer Science
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry
Centralized inter-network spectrum sharing with opportunistic frequency reuse
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Extended dynamic subgraph statistics using h-index parameterized data structures
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Counting triangles and the curse of the last reducer
Proceedings of the 20th international conference on World wide web
Confluent drawing algorithms using rectangular dualization
GD'10 Proceedings of the 18th international conference on Graph drawing
Listing all maximal cliques in large sparse real-world graphs
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Unique small subgraphs are not easier to find
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Simultaneous embedding with two bends per edge in polynomial area
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Finding the smallest H-Subgraph in real weighted graphs and related problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Simultaneous embedding of planar graphs with few bends
GD'04 Proceedings of the 12th international conference on Graph Drawing
Arboricity, h-index, and dynamic algorithms
Theoretical Computer Science
Approximation scheme for lowest outdegree orientation and graph density measures
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The hamiltonian augmentation problem and its applications to graph drawing
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Extended dynamic subgraph statistics using h-index parameterized data structures
Theoretical Computer Science
"Tri, tri again": finding triangles and small subgraphs in a distributed setting
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Kinetic and stationary point-set embeddability for plane graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Maximal cliques based rigid body motion segmentation with a RGB-D camera
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part II
A space efficient streaming algorithm for triangle counting using the birthday paradox
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Expressive languages for selecting groups from graph-structured data
Proceedings of the 22nd international conference on World Wide Web
Simmelian backbones: amplifying hidden homophily in Facebook networks
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Parallel triangle counting in massive streaming graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Top-K structural diversity search in large networks
Proceedings of the VLDB Endowment
Why do simple algorithms for triangle enumeration work in the real world?
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.01 |