The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Daniel Stefankovic: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  25. Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. [Citation Graph (, )][DBLP]


  26. Density Estimation in Linear Time. [Citation Graph (, )][DBLP]


  27. Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. [Citation Graph (, )][DBLP]


  28. Removing Independently Even Crossings. [Citation Graph (, )][DBLP]


  29. Crossing Number of Graphs with Rotation Systems. [Citation Graph (, )][DBLP]


  30. Crossing Numbers and Parameterized Complexity. [Citation Graph (, )][DBLP]


  31. The Complexity of Counting Eulerian Tours in 4-Regular Graphs. [Citation Graph (, )][DBLP]


  32. Worst-Case Synchronous Grammar Rules. [Citation Graph (, )][DBLP]


  33. Density estimation in linear time [Citation Graph (, )][DBLP]


  34. Approximating L1-distances between mixture distributions using random projections [Citation Graph (, )][DBLP]


  35. A graph polynomial for independent sets of bipartite graphs [Citation Graph (, )][DBLP]


  36. Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species [Citation Graph (, )][DBLP]


  37. Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees [Citation Graph (, )][DBLP]


  38. A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions [Citation Graph (, )][DBLP]


  39. Odd Crossing Number and Crossing Number Are Not the Same. [Citation Graph (, )][DBLP]


  40. Removing even crossings on surfaces. [Citation Graph (, )][DBLP]


Search in 0.027secs, Finished in 0.029secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002