- Algorithms for Normal Curves and Surfaces Marcus Schaefer1
- Fourier Transforms in Computer Science Daniel Stefankovi c
- arXiv:math.ST/0606650 Negative Examples for Sequential Importance
- Knowledge Representation and Reasoning for MixedInitiative Planning
- The complexity of shortest path and dilation bounded interval routing #
- The complexity of shortest path and dilation bounded interval routing
- Decidability of string graphs$ Marcus Schaefera,
- Phylogeny of Mixture Models: Robustness of Maximum Likelihood and NonIdentifiable Distributions
- SOLVABILITY OF GRAPH INEQUALITIES MARCUS SCHAEFER AND DANIEL STEFANKOVIC
- Approximating L1-distances between mixture distributions using random projections
- Algorithms for Normal Curves and Surfaces Marcus Schaefer 1 , Eric Sedgwick 2 , and Daniel Stefankovic 3
- Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms6
- Odd Crossing Number and Crossing Number Are Not Michael J. Pelsmajer Marcus Schaefer
- Acyclic orientations do not lead to optimal deadlockfree packet routing algorithms I
- Train Tracks and Confluent Drawings Peter Hui,1
- Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Marcus Schaefer
- Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related
- Journal of Machine Learning Research 8 (2007) 18351865 Submitted 10/06; Revised 4/07; Published 8/07 Behavioral Shaping for Geometric Concepts
- ACCELERATING SIMULATED ANNEALING FOR THE PERMANENT AND COMBINATORIAL COUNTING PROBLEMS
- Spiralling and Folding: The Topological View Marcus Schaefer
- SOLVABILITY OF GRAPH INEQUALITIES # MARCUS SCHAEFER + AND DANIEL STEFANKOVI
- Pitfalls of Heterogeneous Processes for Phylogenetic Reconstruction DANIEL STEFANKOVI C1
- Recognizing string graphs in NP Marcus Schaefer, a,# Eric Sedgwick, a and Daniel S
- Crossing Number of Graphs with Rotation Systems
- Removing Even Crossings on Surfaces Michael J. Pelsmajer 1
- On the complexity of multi-dimensional interval routing schemes
- Pitfalls of Heterogeneous Processes for Phylogenetic Reconstruction STEFANKOVI
- Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
- Adaptive Simulated Annealing: A Near-Optimal Connection between Sampling and Counting
- Locally Testable Cyclic Codes Lszl Babai, Amir Shpilka, and Daniel Stefankovic
- The Complexity of Counting Eulerian Tours in 4-Regular Graphs
- arXiv:math.ST/0606650v230Jun2006 Negative Examples for Sequential Importance
- Efficient Deadlock-Free Multi-dimensional Interval Routing
- Recognizing string graphs in NP Marcus Schaefer,a,
- Odd Crossing Number Is Not Crossing Number Michael J. Pelsmajer1
- REMOVING INDEPENDENTLY EVEN CROSSINGS MICHAEL J. PELSMAJER, MARCUS SCHAEFER, AND DANIEL STEFANKOVIC
- Removing Independently Even Crossings Michael J. Pelsmajer1,
- Crossing Numbers and Parameterized Michael J. Pelsmajer1
- Folding and Spiralling: The Word View Marcus Schaefer 1
- Removing even crossings Michael J. Pelsmajer a
- Density estimation in linear time Satyaki Mahalanabis and Daniel Stefankovic
- Phylogeny of Mixture Models: Robustness of Maximum Likelihood and Non-Identifiable Distributions
- On the computational complexity of Nash equilibria for (0,1) bimatrix games
- Decidability of string graphs $ Marcus Schaefer a,# and Daniel S
- Locally Testable Cyclic Codes Lszl Babai, Amir Shpilka, and Daniel
- On the computational complexity of Nash equilibria for (0, 1) bimatrix games
- Removing even crossings on surfaces Michael J. Pelsmajera
- The Complexity of Shortest Path and Dilation Bounded Interval Routing*
- On the complexity of multidimensional interval routing schemes #
- Negative Examples for Sequential Importance Sampling of
- arXiv:0911.4732v4[cs.DM]10Feb2010 A graph polynomial for independent sets of bipartite graphs
- A graph polynomial for independent sets of bipartite graphs
- The Complexity of Counting Eulerian Tours in 4-regular Graphs
- Spiraling and Folding: The Word View Marcus Schaefer Eric Sedgwick Daniel Stefankovic
- Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees
- On the Complexity of Multi-Dimensional Interval Routing Schemes
- Crossing Numbers of Graphs with Rotation Systems Michael J. Pelsmajer Marcus Schaefer Daniel Stefankovic
- Removing Even Crossings Michael J. Pelsmajer1
