On-line coloring of geometric intersection graphs
Computational Geometry: Theory and Applications
Geometric Systems of Disjoint Representatives
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Theoretical Computer Science - Algorithmic combinatorial game theory
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the cubicity of certain graphs
Information Processing Letters
On finding short resolution refutations and small unsatisfiable subsets
Theoretical Computer Science - Parameterized and exact computation
Journal of Combinatorial Theory Series B
Discrete Applied Mathematics
Note: Boxicity and maximum degree
Journal of Combinatorial Theory Series B
Multicast tree allocation algorithms for Distributed Interactive Simulation
International Journal of High Performance Computing and Networking
On stable cutsets in claw-free graphs and planar graphs
Journal of Discrete Algorithms
Maximum independent set of rectangles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the cubicity of bipartite graphs
Information Processing Letters
Boxicity of graphs with bounded degree
European Journal of Combinatorics
Systems of distant representatives
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On the cubicity of certain graphs
Information Processing Letters
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
Discrete Applied Mathematics
Chordal graphs as intersection graphs of pseudosegments
GD'06 Proceedings of the 14th international conference on Graph drawing
The complexity of several realizability problems for abstract topological graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Discrete Applied Mathematics
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph
Discrete Applied Mathematics
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Spanners of bounded degree graphs
Information Processing Letters
Convex polygon intersection graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
A constant factor approximation algorithm for boxicity of circular arc graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
Geometric representation of graphs in low dimension
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Faithful representations of graphs by islands in the extended grid
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On spanning galaxies in digraphs
Discrete Applied Mathematics
Fixed parameter tractability of independent set in segment intersection graphs
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Independence and coloring problems on intersection graphs of disks
Efficient Approximation and Online Algorithms
Twin-Cover: beyond vertex cover in parameterized algorithmics
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Paths of bounded length and their cuts: Parameterized complexity and algorithms
Discrete Optimization
SIAM Journal on Discrete Mathematics
Geometric intersection graph: do short cycles help?
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Polynomial time and parameterized approximation algorithms for boxicity
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Boundary properties of the satisfiability problems
Information Processing Letters
Cubicity, degeneracy, and crossing number
European Journal of Combinatorics
Strong edge-colouring and induced matchings
Information Processing Letters
| Hi-index | 0.05 |