| 2008 |
|---|
| 32 | EE | Satyaki Mahalanabis,
Daniel Stefankovic:
Density Estimation in Linear Time.
COLT 2008: 503-512 |
| 31 | EE | Satyaki Mahalanabis,
Daniel Stefankovic:
Approximating L1-distances between mixture distributions using random projections
CoRR abs/0804.1170: (2008) |
| 30 | EE | Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Odd Crossing Number and Crossing Number Are Not the Same.
Discrete & Computational Geometry 39(1-3): 442-454 (2008) |
| 29 | EE | Ivona Bezáková,
Daniel Stefankovic,
Vijay V. Vazirani,
Eric Vigoda:
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems.
SIAM J. Comput. 37(5): 1429-1454 (2008) |
| 2007 |
|---|
| 28 | | Marcus Schaefer,
Eric Sedgwick,
Daniel Stefankovic:
Spiralling and Folding: The Topological View.
CCCG 2007: 73-76 |
| 27 | EE | Daniel Stefankovic,
Santosh Vempala,
Eric Vigoda:
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting.
FOCS 2007: 183-193 |
| 26 | EE | Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Crossing Number of Graphs with Rotation Systems.
Graph Drawing 2007: 3-12 |
| 25 | EE | Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Crossing Numbers and Parameterized Complexity.
Graph Drawing 2007: 31-36 |
| 24 | EE | Peter Hui,
Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Train Tracks and Confluent Drawings.
Algorithmica 47(4): 465-479 (2007) |
| 23 | EE | Satyaki Mahalanabis,
Daniel Stefankovic:
Density estimation in linear time
CoRR abs/0712.2869: (2007) |
| 22 | EE | Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Removing even crossings.
J. Comb. Theory, Ser. B 97(4): 489-500 (2007) |
| 2006 |
|---|
| 21 | EE | Ivona Bezáková,
Alistair Sinclair,
Daniel Stefankovic,
Eric Vigoda:
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables.
ESA 2006: 136-147 |
| 20 | EE | Ivona Bezáková,
Daniel Stefankovic,
Vijay V. Vazirani,
Eric Vigoda:
Accelerating simulated annealing for the permanent and combinatorial counting problems.
SODA 2006: 900-907 |
| 19 | EE | Daniel Stefankovic,
Santosh Vempala,
Eric Vigoda:
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
CoRR abs/cs/0612058: (2006) |
| 2005 |
|---|
| 18 | EE | Michael J. Pelsmajer,
Marcus Schaefer,
Daniel Stefankovic:
Odd Crossing Number Is Not Crossing Number.
Graph Drawing 2005: 386-396 |
| 17 | EE | László Babai,
Amir Shpilka,
Daniel Stefankovic:
Locally testable cyclic codes.
IEEE Transactions on Information Theory 51(8): 2849-2858 (2005) |
| 16 | EE | Bruno Codenotti,
Daniel Stefankovic:
On the computational complexity of Nash equilibria for (0, 1) bimatrix games.
Inf. Process. Lett. 94(3): 145-150 (2005) |
| 15 | EE | Marcus Schaefer,
Daniel Stefankovic:
Solvability of Graph Inequalities.
SIAM J. Discrete Math. 19(3): 728-743 (2005) |
| 2004 |
|---|
| 14 | EE | Peter Hui,
Marcus Schaefer,
Daniel Stefankovic:
Train Tracks and Confluent Drawings.
Graph Drawing 2004: 318-328 |
| 13 | EE | László Babai,
Daniel Stefankovic:
Simultaneous diophantine approximation with excluded primes.
SODA 2004: 1123-1129 |
| 12 | EE | Marcus Schaefer,
Daniel Stefankovic:
Decidability of string graphs.
J. Comput. Syst. Sci. 68(2): 319-334 (2004) |
| 2003 |
|---|
| 11 | EE | László Babai,
Amir Shpilka,
Daniel Stefankovic:
Locally Testable Cyclic Codes.
FOCS 2003: 116-125 |
| 10 | EE | Marcus Schaefer,
Eric Sedgwick,
Daniel Stefankovic:
Recognizing string graphs in NP.
J. Comput. Syst. Sci. 67(2): 365-380 (2003) |
| 2002 |
|---|
| 9 | EE | Marcus Schaefer,
Eric Sedgwick,
Daniel Stefankovic:
Algorithms for Normal Curves and Surfaces.
COCOON 2002: 370-380 |
| 8 | EE | Marcus Schaefer,
Eric Sedgwick,
Daniel Stefankovic:
Recognizing string graphs in NP.
STOC 2002: 1-6 |
| 2001 |
|---|
| 7 | EE | Marcus Schaefer,
Daniel Stefankovic:
Decidability of string graphs.
STOC 2001: 241-246 |
| 6 | EE | László Babai,
Peter Frankl,
Samuel Kutin,
Daniel Stefankovic:
Set Systems with Restricted Intersections modulo Prime Powers.
J. Comb. Theory, Ser. A 95(1): 39-73 (2001) |
| 2000 |
|---|
| 5 | EE | Daniel Stefankovic:
Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms.
Inf. Process. Lett. 73(5-6): 221-225 (2000) |
| 4 | EE | Rastislav Kralovic,
Peter Ruzicka,
Daniel Stefankovic:
The complexity of shortest path and dilation bounded interval routing.
Theor. Comput. Sci. 234(1-2): 85-107 (2000) |
| 3 | EE | Peter Ruzicka,
Daniel Stefankovic:
On the complexity of multi-dimensional interval routing schemes.
Theor. Comput. Sci. 245(2): 255-280 (2000) |
| 1998 |
|---|
| 2 | EE | Rastislav Kralovic,
Branislav Rovan,
Peter Ruzicka,
Daniel Stefankovic:
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks.
DISC 1998: 273-287 |
| 1997 |
|---|
| 1 | | Rastislav Kralovic,
Peter Ruzicka,
Daniel Stefankovic:
The Complexity of Shortest Path and Dilation Bounded Interval Routing.
Euro-Par 1997: 258-265 |
