Result 1 to 20 of 88 total
The clique problem in ray intersection graphs. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 241-252 (2012).
1
Annotating simplices with a homology basis and its applications. (English)
Fomin, Fedor V. (ed.) et al., Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 189-200 (2012).
2
The class cover problem with boxes. (English)
Comput. Geom. 45, No. 7, 294-304 (2012).
3
Algorithms for the edge-width of an embedded graph. (English)
Comput. Geom. 45, No. 5-6, 215-224 (2012).
4
Many distances in planar graphs. (English)
Algorithmica 62, No. 1-2, 361-381 (2012).
5
Finding cycles with topological properties in embedded graphs. (English)
SIAM J. Discrete Math. 25, No. 4, 1600-1614 (2011).
6
On the $b$-chromatic number of regular graphs. (English)
Discrete Appl. Math. 159, No. 13, 1303-1310 (2011).
7
Minimum cell connection and separation in line segment arrangements. (English)
Comput. Res. Repos. 2011, Article No. 1104.4618 (2011).
8
Crossing number and weighted crossing number of near-planar graphs. (English)
Algorithmica 60, No. 3, 484-504 (2011).
9
The Fibonacci dimension of a graph. (English)
Electron. J. Comb. 18, No. 1, Research Paper P55, 23 p., electronic only (2011).
10
The complexity of obtaining a distance-balanced graph. (English)
Electron. J. Comb. 18, No. 1, Research Paper P49, 10 p., electronic only (2011).
11
Geometric simultaneous embeddings of a graph and a matching. (English)
J. Graph Algorithms Appl. 15, No. 1, 79-96 (2011).
12
Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension (English)
ACM Transactions on Algorithms 7, No. 4, 43 (2011).
13
Obnoxious centers in graphs. (English)
SIAM J. Discrete Math. 24, No. 4, 1713-1730 (2010).
14
Finding the most relevant fragments in networks. (English)
J. Graph Algorithms Appl. 14, No. 2, 307-336 (2010).
15
Algorithmic aspects of proportional symbol maps. (English)
Algorithmica 58, No. 3, 543-565 (2010).
16
Edge-removal and non-crossing configurations in geometric graphs. (English)
Discrete Math. Theor. Comput. Sci. 12, No. 1, 75-86, electronic only (2010).
17
Geometric simultaneous embeddings of a graph and a matching. (English)
Eppstein, David (ed.) et al., Graph drawing. 17th international symposium, GD 2009, Chicago, IL, USA, September 22‒25, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11804-3/pbk). Lecture Notes in Computer Science 5849, 183-194 (2010).
18
Facility location problems in the plane based on reverse nearest neighbor queries. (English)
Eur. J. Oper. Res. 202, No. 1, 99-106 (2010).
19
Edge-removal and non-crossing configurations in geometric graphs (English)
Discrete Mathematics & Theoretical Computer Science 12, No. 1, 75-86 (2010).
20
Result 1 to 20 of 88 total
Start
Contact
Print
General Help
