Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Daniel Stefankovic" ( http://dblp.L3S.de/Authors/Daniel_Stefankovic )

  Author page on DBLP  Author page in RDF  Community of Daniel Stefankovic in ASPL-2

Publication years (Num. hits)
1997-2005 (18) 2006-2007 (15) 2008-2010 (16) 2011-2012 (12)
Publication types (Num. hits)
article(35) inproceedings(26)
Venues (Conferences, Journals, ...)
CoRR(10) Graph Drawing(6) Algorithmica(4) FOCS(3) SIAM J. Discrete Math.(3) SODA(3) CCCG(2) Electronic Notes in Discrete M...(2) Inf. Process. Lett.(2) J. Comput. Syst. Sci.(2) SIAM J. Comput.(2) STOC(2) Theor. Comput. Sci.(2) APPROX-RANDOM(1) COCOON(1) COLT(1) More (+10 of total 31)
Authors
Daniel Stefankovic(61) Marcus Schaefer(24) Eric Vigoda(17) Michael J. Pelsmajer(13) Eric Sedgwick(7) Qi Ge(7) Santosh Vempala(6) László Babai(4) Linji Yang(4) Peter Ruzicka(4) Andreas Galanis(3) Ivona Bezáková(3) Rastislav Kralovic(3) Satyaki Mahalanabis(3) Amir Shpilka(2) Juan Carlos Vera(2) More (+10 of total 31)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 6 occurrences of 6 keywords
Results
Found 61 publication records. Showing 61 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Qi Ge, Daniel Stefankovic The Complexity of Counting Eulerian Tours in 4-regular Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Andreas Galanis, Daniel Stefankovic, Eric Vigoda Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Daniel Stefankovic, Santosh Vempala, Eric Vigoda A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Crossing Numbers of Graphs with Rotation Systems. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Spiraling and Folding: The Word View. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Daniel Stefankovic, Eric Vigoda Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Hanani-Tutte and Monotone Drawings. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. Search on Bibsonomy SODA The full citation details ... 2011 DBLP  BibTeX  RDF
1Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Parikshit Gopalan, Adam Klivans, Raghu Meka, Daniel Stefankovic, Santosh Vempala, Eric Vigoda An FPTAS for #Knapsack and Related Counting Problems. Search on Bibsonomy FOCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Adjacent Crossings Do Matter. Search on Bibsonomy Graph Drawing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Daniel Stefankovic, Eric Vigoda Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Daniel Stefankovic, Santosh Vempala, Eric Vigoda A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Qi Ge, Daniel Stefankovic The Complexity of Counting Eulerian Tours in 4-Regular Graphs Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Removing Independently Even Crossings. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Qi Ge, Daniel Stefankovic The Complexity of Counting Eulerian Tours in 4-Regular Graphs. Search on Bibsonomy LATIN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Qi Ge, Daniel Stefankovic A graph polynomial for independent sets of bipartite graphs. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Removing even crossings on surfaces. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Daniel Stefankovic, Santosh Vempala, Eric Vigoda Adaptive simulated annealing: A near-optimal connection between sampling and counting. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF simulated annealing, Markov chain Monte Carlo, Counting
1Qi Ge, Daniel Stefankovic A graph polynomial for independent sets of bipartite graphs Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Removing Independently Even Crossings. Search on Bibsonomy Graph Drawing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Odd Crossing Number and Crossing Number Are Not the Same. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Satyaki Mahalanabis, Daniel Stefankovic Approximating L1-distances between mixture distributions using random projections Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. Search on Bibsonomy CCCG The full citation details ... 2008 DBLP  BibTeX  RDF
1Satyaki Mahalanabis, Daniel Stefankovic Density Estimation in Linear Time. Search on Bibsonomy COLT The full citation details ... 2008 DBLP  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Removing even crossings. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Removing Even Crossings on Surfaces. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Folding and Spiralling: The Word View. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Train Tracks and Confluent Drawings. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Daniel Stefankovic, Eric Vigoda Phylogeny of Mixture Models: Robustness of Maximum Likelihood and Non-Identifiable Distributions. Search on Bibsonomy Journal of Computational Biology The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Manu Chhabra, Robert A. Jacobs, Daniel Stefankovic Behavioral Shaping for Geometric Concepts. Search on Bibsonomy Journal of Machine Learning Research The full citation details ... 2007 DBLP  BibTeX  RDF
1Satyaki Mahalanabis, Daniel Stefankovic Density estimation in linear time Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Daniel Gildea, Daniel Stefankovic Worst-Case Synchronous Grammar Rules. Search on Bibsonomy HLT-NAACL The full citation details ... 2007 DBLP  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Spiralling and Folding: The Topological View. Search on Bibsonomy CCCG The full citation details ... 2007 DBLP  BibTeX  RDF
1Daniel Stefankovic, Santosh Vempala, Eric Vigoda Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Crossing Number of Graphs with Rotation Systems. Search on Bibsonomy Graph Drawing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF computational complexity, computational geometry, crossing number
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Crossing Numbers and Parameterized Complexity. Search on Bibsonomy Graph Drawing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Daniel Stefankovic, Santosh Vempala, Eric Vigoda Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. Search on Bibsonomy ESA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda Accelerating simulated annealing for the permanent and combinatorial counting problems. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Bruno Codenotti, Daniel Stefankovic On the computational complexity of Nash equilibria for (0, 1) bimatrix games. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Daniel Stefankovic Solvability of Graph Inequalities. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1László Babai, Amir Shpilka, Daniel Stefankovic Locally testable cyclic codes. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic Odd Crossing Number Is Not Crossing Number. Search on Bibsonomy Graph Drawing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Daniel Stefankovic Decidability of string graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1László Babai, Daniel Stefankovic Simultaneous diophantine approximation with excluded primes. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Peter Hui, Marcus Schaefer, Daniel Stefankovic Train Tracks and Confluent Drawings. Search on Bibsonomy Graph Drawing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Recognizing string graphs in NP. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1László Babai, Amir Shpilka, Daniel Stefankovic Locally Testable Cyclic Codes. Search on Bibsonomy FOCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Algorithms for Normal Curves and Surfaces. Search on Bibsonomy COCOON The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic Recognizing string graphs in NP. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1László Babai, Peter Frankl, Samuel Kutin, Daniel Stefankovic Set Systems with Restricted Intersections modulo Prime Powers. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Marcus Schaefer, Daniel Stefankovic Decidability of string graphs. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Daniel Stefankovic Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic The complexity of shortest path and dilation bounded interval routing. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Peter Ruzicka, Daniel Stefankovic On the complexity of multi-dimensional interval routing schemes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Rastislav Kralovic, Branislav Rovan, Peter Ruzicka, Daniel Stefankovic Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks. Search on Bibsonomy DISC The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic The Complexity of Shortest Path and Dilation Bounded Interval Routing. Search on Bibsonomy Euro-Par The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #61 of 61 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.