Result 1 to 20 of 59 total
Planarizing an unknown surface. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 266-275 (2012).
1
Convergence and approximation in potential games. (English)
Theor. Comput. Sci. 438, 13-27 (2012).
2
On graph crossing number and edge planarization (English)
SODA, 1050-1069 (2011).
3
Computationally limited randomness (English)
ICS, 522-536 (2011).
4
Near-optimal distortion bounds for embedding doubling spaces into $L_{1}$ (English)
STOC, 765-772 (2011).
5
Inapproximability for metric embeddings into $\Bbb{R}^{d}$. (English)
Trans. Am. Math. Soc. 362, No. 12, 6341-6365 (2010).
6
Online embeddings. (English)
Serna, Maria (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1‒3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15368-6/pbk). Lecture Notes in Computer Science 6302, 246-259 (2010).
7
Randomly removing $g$ handles at once. (English)
Comput. Geom. 43, No. 8, 655-662 (2010).
8
Optimal stochastic planarization. (English)
Comput. Res. Repos. 2010, Article No. 1004.1666 (2010).
9
Randomly removing g handles at once. (English)
Comput. Res. Repos. 2010, Article No. 1003.1426 (2010).
10
Cdnsim: A simulation tool for content distribution networks (English)
ACM Trans. Model. Comput. Simul. 20, No. 2 (2010).
11
On distributing symmetric streaming computations (English)
ACM Transactions on Algorithms 6, No. 4 (2010).
12
Undecidability and intractability results concerning Datalog programs and their persistency numbers (English)
ACM Trans. Comput. Log. 11, No. 2 (2010).
13
Inapproximability for planar embedding problems (English)
SODA, 222-235 (2010).
14
Genus and the geometry of the cut graph (English)
SODA, 193-201 (2010).
15
Online embeddings (English)
APPROX-RANDOM, 246-259 (2010).
16
Optimal stochastic planarization (English)
FOCS, 163-170 (2010).
17
Pathwidth, trees, and random embeddings. (English)
Comput. Res. Repos. 2009, Article No. 0910.1409 (2009).
18
Streaming embeddings with slack. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21‒23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 483-494 (2009).
19
Cdns content outsourcing via generalized communities (English)
IEEE Trans. Knowl. Data Eng. 21, No. 1, 137-151 (2009).
20
Result 1 to 20 of 59 total
Start
Contact
Print
General Help
