Daniel Stefankovic

Yunquan Zhang

Proceedings of the 41st International Conference on Parallel Processing, 2012

2011

Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Spiraling and Folding: The Word View.

[BibT_eX]

[DOI]

Algorithmica, 2011

Crossing Numbers of Graphs with Rotation Systems.

[BibT_eX]

[DOI]

Algorithmica, 2011

Hanani-Tutte and Monotone Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Adjacent Crossings Do Matter.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

An FPTAS for #Knapsack and Related Counting Problems.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species

[BibT_eX]

[DOI]

CoRR, 2010

The Complexity of Counting Eulerian Tours in 4-Regular Graphs.

[BibT_eX]

[DOI]

Qi Ge

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

A graph polynomial for independent sets of bipartite graphs.

[BibT_eX]

[DOI]

Qi Ge

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009

Removing Independently Even Crossings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

Approximating L1-distances Between Mixture Distributions Using Random Projections.

[BibT_eX]

[DOI]

Satyaki Mahalanabis

Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

2008

Odd Crossing Number and Crossing Number Are Not the Same.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

Density Estimation in Linear Time.

[BibT_eX]

[DOI]

Satyaki Mahalanabis

Proceedings of the 21st Annual Conference on Learning Theory, 2008

Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Behavioral Shaping for Geometric Concepts.

[BibT_eX]

[DOI]

Manu Chhabra

Robert A. Jacobs

J. Mach. Learn. Res., 2007

Removing even crossings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

Phylogeny of Mixture Models: Robustness of Maximum Likelihood and Non-Identifiable Distributions.

[BibT_eX]

[DOI]

J. Comput. Biol., 2007

Folding and Spiralling: The Word View.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Removing Even Crossings on Surfaces.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Train Tracks and Confluent Drawings.

[BibT_eX]

[DOI]

Algorithmica, 2007

Worst-Case Synchronous Grammar Rules.

[BibT_eX]

[DOI]

Daniel Gildea

Proceedings of the Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, 2007

Crossing Numbers and Parameterized Complexity.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Crossing Number of Graphs with Rotation Systems.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting.

[BibT_eX]

[DOI]

Santosh S. Vempala

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

Spiralling and Folding: The Topological View.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Accelerating simulated annealing for the permanent and combinatorial counting problems.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Negative Examples for Sequential Importance Sampling of Binary Contingency Tables.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

2005

Solvability of Graph Inequalities.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

On the computational complexity of Nash equilibria for (0, 1) bimatrix games.

[BibT_eX]

[DOI]

Bruno Codenotti

Inf. Process. Lett., 2005

Odd Crossing Number Is Not Crossing Number.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

2004

Simultaneous diophantine approximation with excluded primes.

[BibT_eX]

[DOI]

László Babai

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Train Tracks and Confluent Drawings.

[BibT_eX]

[DOI]

Peter Hui

Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003

Locally Testable Cyclic Codes.

[BibT_eX]

[DOI]

László Babai

Amir Shpilka

Proceedings of the 44th Symposium on Foundations of Computer Science, 2003

2002

Recognizing string graphs in NP.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Algorithms for Normal Curves and Surfaces.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

Set Systems with Restricted Intersections modulo Prime Powers.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2001

Decidability of string graphs.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000

On the complexity of multi-dimensional interval routing schemes.

[BibT_eX]

[DOI]

Peter Ruzicka

Theor. Comput. Sci., 2000

Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

1998

Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 12th International Symposium, 1998

1997

The Complexity of Shortest Path and Dilation Bounded Interval Routing.

[BibT_eX]

[DOI]

Rastislav Kralovic

Peter Ruzicka