Daniel Stefankovic

167 papers A* 28A 13B 7Misc 1Journal 102Unranked 16

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Critical window for approximate counting in dense Ising models. CoRR Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2025	J	`jnl`	Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling. ACM Trans. Algorithms Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2025	J	`jnl`	How Hard is it to be a Star? Convex Geometry and the Real Hierarchy. CoRR Marcus Schaefer, Daniel Stefankovic
2025	J	`jnl`	Optimal mixing via tensorization for random independent sets on arbitrary trees. Comb. Probab. Comput. Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2025	J	`jnl`	Special Section on the Sixtieth Annual Symposium on Foundations of Computer Science (FOCS 2019). SIAM J. Comput. Yuval Filmus, Debmalya Panigrahi, Daniel Stefankovic, Avishay Tal
2024	J	`jnl`	Beyond the Existential Theory of the Reals. Theory Comput. Syst. Marcus Schaefer, Daniel Stefankovic
2024	J	`jnl`	Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. ACM Trans. Algorithms Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2024	J	`jnl`	Spiraling and Folding: The Topological View. Discret. Comput. Geom. Jan Kyncl, Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
2023	A*	`conf`	Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling. COLT Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2023	J	`jnl`	Implementations and the independent set polynomial below the Shearer threshold. Theor. Comput. Sci. Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2023	A	`conf`	Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. APPROX/RANDOM Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2023	J	`jnl`	Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. CoRR Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2023	J	`jnl`	Spectral Independence Lecture Notes. CoRR Daniel Stefankovic, Eric Vigoda
2023	J	`jnl`	The Swendsen-Wang dynamics on trees. Random Struct. Algorithms Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2022	A*	`conf`	Approximating Observables Is as Hard as Counting. ICALP Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2022	J	`jnl`	Approximating observables is as hard as counting. CoRR Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2022	J	`jnl`	Beyond the Existential Theory of the Reals. CoRR Marcus Schaefer, Daniel Stefankovic
2022	A*	`conf`	Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. ICALP Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2022	J	`jnl`	Identity Testing for High-Dimensional Distributions via Entropy Tensorization. CoRR Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2022	A*	`conf`	Metastability of the Potts Ferromagnet on Random Regular Graphs. ICALP Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda
2022	J	`jnl`	Metastability of the Potts ferromagnet on random regular graphs. CoRR Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda
2022	A*	`conf`	On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. SODA Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda
2022	A*	`conf`	Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. SODA Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2022	J	`jnl`	Spiraling and Folding: The Topological View. CoRR Jan Kyncl, Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
2022	J	`jnl`	The Degenerate Crossing Number and Higher-Genus Embeddings. J. Graph Algorithms Appl. Marcus Schäfer, Daniel Stefankovic
2021	J	`jnl`	Fast sampling via spectral independence beyond bounded-degree graphs. CoRR Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2021	J	`jnl`	Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. J. Mach. Learn. Res. Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2021	J	`jnl`	On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization. CoRR Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Stefankovic, Eric Vigoda
2021	A*	`conf`	Rapid Mixing for Colorings via Spectral Independence. SODA Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2021	J	`jnl`	Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. CoRR Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2021	A	`conf`	Statistical mechanical analysis of neural network pruning. UAI Rupam Acharyya, Ankani Chattoraj, Boyu Zhang, Shouman Das, Daniel Stefankovic
2021	J	`jnl`	The Complexity of Approximating the Matching Polynomial in the Complex Plane. ACM Trans. Comput. Theory Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2021	—	`conf`	The Swendsen-Wang Dynamics on Trees. APPROX-RANDOM Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2020	A*	`conf`	Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. COLT Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2020	J	`jnl`	Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models. CoRR Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2020	J	`jnl`	Inapproximability of the Independent Set Polynomial in the Complex Plane. SIAM J. Comput. Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2020	J	`jnl`	Lower Bounds for Testing Graphical Models: Colorings and Antiferromagnetic Ising Models. J. Mach. Learn. Res. Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2020	J	`jnl`	Rapid Mixing for Colorings via Spectral Independence. CoRR Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2020	J	`jnl`	Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. SIAM J. Discret. Math. Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang
2020	J	`jnl`	Structure Learning of H-Colorings. ACM Trans. Algorithms Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2020	B	`conf`	The Hardness of Sampling Connected Subgraphs. LATIN Andrew Read-McFarland, Daniel Stefankovic
2020	J	`jnl`	The Swendsen-Wang Dynamics on Trees. CoRR Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2020	A*	`conf`	The complexity of approximating averages on bounded-degree graphs. FOCS Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2020	J	`jnl`	The complexity of approximating averages on bounded-degree graphs. CoRR Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2020	J	`jnl`	Understanding Diversity based Pruning of Neural Networks - Statistical Mechanical Analysis. CoRR Rupam Acharyya, Boyu Zhang, Ankani Chattoraj, Shouman Das, Daniel Stefankovic
2019	J	`jnl`	Approximation via Correlation Decay When Strong Spatial Mixing Fails. SIAM J. Comput. Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
2019	J	`jnl`	Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. SIAM J. Comput. Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin
2019	—	`conf`	Improved Strong Spatial Mixing for Colorings on Trees. APPROX-RANDOM Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2019	J	`jnl`	Improved Strong Spatial Mixing for Colorings on Trees. CoRR Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2019	A*	`conf`	Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. COLT Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2019	J	`jnl`	Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. CoRR Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2019	J	`jnl`	Swendsen-Wang algorithm on the mean-field Potts model. Random Struct. Algorithms Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2019	A*	`conf`	The Complexity of Approximating the Matching Polynomial in the Complex Plane. ICALP Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2018	A*	`conf`	Inapproximability of the independent set polynomial in the complex plane. STOC Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2018	B	`conf`	On Counting Perfect Matchings in General Graphs. LATIN Daniel Stefankovic, Eric Vigoda, John Wilmes
2018	A*	`conf`	Sampling Random Colorings of Sparse Random Graphs. SODA Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2018	—	`conf`	Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. APPROX-RANDOM Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang
2018	J	`jnl`	Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. CoRR Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang
2018	B	`conf`	Structure Learning of ${H}$-colorings. ALT Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2018	J	`jnl`	The Complexity of Tensor Rank. Theory Comput. Syst. Marcus Schaefer, Daniel Stefankovic
2018	J	`jnl`	The complexity of approximating the matching polynomial in the complex plane. CoRR Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2017	J	`jnl`	Fixed Points, Nash Equilibria, and the Existential Theory of the Reals. Theory Comput. Syst. Marcus Schaefer, Daniel Stefankovic
2017	—	`conf`	Glauber Dynamics for Ising Model on Convergent Dense Graph Sequences. APPROX-RANDOM Rupam Acharyya, Daniel Stefankovic
2017	A*	`conf`	Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. ICALP Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2017	J	`jnl`	Inapproximability of the independent set polynomial in the complex plane. CoRR Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2017	J	`jnl`	On Counting Perfect Matchings in General Graphs. CoRR Daniel Stefankovic, Eric Vigoda, John Wilmes
2017	A*	`conf`	On The Projection Operator to A Three-view Cardinality Constrained Set. ICML Haichuan Yang, Shupeng Gui, Chuyang Ke, Daniel Stefankovic, Ryohei Fujimaki, Ji Liu
2017	J	`jnl`	On The Projection Operator to A Three-view Cardinality Constrained Set. CoRR Haichuan Yang, Shupeng Gui, Chuyang Ke, Daniel Stefankovic, Ryohei Fujimaki, Ji Liu
2017	A	`conf`	Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. AISTATS Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda
2017	J	`jnl`	Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. CoRR Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda
2017	J	`jnl`	Sampling Random Colorings of Sparse Random Graphs. CoRR Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda
2017	J	`jnl`	Structure Learning of H-colorings. CoRR Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda
2016	J	`jnl`	#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. J. Comput. Syst. Sci. Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda
2016	A*	`conf`	Approximation via Correlation Decay When Strong Spatial Mixing Fails. ICALP Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
2016	A*	`conf`	Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. FOCS Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin
2016	J	`jnl`	Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. CoRR Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin
2016	J	`jnl`	Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. SIAM J. Comput. Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang
2016	J	`jnl`	Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. Comb. Probab. Comput. Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2016	J	`jnl`	Inapproximability of the independent set polynomial below the Shearer threshold. CoRR Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic
2016	J	`jnl`	The Complexity of Tensor Rank. CoRR Marcus Schaefer, Daniel Stefankovic
2015	J	`jnl`	Approximation via Correlation Decay when Strong Spatial Mixing Fails. CoRR Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic
2015	J	`jnl`	Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region. J. ACM Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2015	A*	`conf`	Spatial mixing and the connective constant: Optimal bounds. SODA Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin
2015	—	`conf`	Swendsen-Wang Algorithm on the Mean-Field Potts Model. APPROX-RANDOM Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2015	J	`jnl`	Swendsen-Wang Algorithm on the Mean-Field Potts Model. CoRR Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2015	A	`conf`	The Degenerate Crossing Number and Higher-Genus Embeddings. GD Marcus Schaefer, Daniel Stefankovic
2014	—	`conf`	#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region. APPROX-RANDOM Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Stefankovic, Eric Vigoda
2014	—	`conf`	Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. APPROX-RANDOM Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang
2014	J	`jnl`	Improved inapproximability results for counting independent sets in the hard-core model. Random Struct. Algorithms Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang
2014	A*	`conf`	Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. STOC Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2014	J	`jnl`	Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. SIAM J. Discret. Math. Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang
2014	J	`jnl`	Sampling Tree Fragments from Forests. Comput. Linguistics Tagyoung Chung, Licheng Fang, Daniel Gildea, Daniel Stefankovic
2014	J	`jnl`	Spatial mixing and the connective constant: Optimal bounds. CoRR Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin
2013	J	`jnl`	BIS-Hardness for Ferromagnetic Potts in the Ordered Phase and Related Results. CoRR Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2013	A	`conf`	Block Additivity of ℤ2-Embeddings. GD Marcus Schaefer, Daniel Stefankovic
2013	J	`jnl`	Inapproximability for Antiferromagnetic Spin Systems in the Tree Non-Uniqueness Region CoRR Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2013	B	`conf`	Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5. TARK Tivadar Papai, Henry A. Kautz, Daniel Stefankovic
2013	J	`jnl`	Reasoning Under the Principle of Maximum Entropy for Modal Logics K45, KD45, and S5. CoRR Tivadar Papai, Henry A. Kautz, Daniel Stefankovic
2012	J	`jnl`	A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions. SIAM J. Comput. Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda
2012	J	`jnl`	A Graph Polynomial for Independent Sets of Bipartite Graphs. Comb. Probab. Comput. Qi Ge, Daniel Stefankovic
2012	J	`jnl`	Adjacent Crossings Do Matter. J. Graph Algorithms Appl. Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2012	J	`jnl`	Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models CoRR Andreas Galanis, Daniel Stefankovic, Eric Vigoda
2012	B	`conf`	Modeling the Locality in Graph Traversals. ICPP Liang Yuan, Chen Ding, Daniel Stefankovic, Yunquan Zhang
2012	J	`jnl`	Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. Algorithmica Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda
2012	—	`conf`	Slice Normalized Dynamic Markov Logic Networks. NIPS Tivadar Papai, Henry A. Kautz, Daniel Stefankovic
2012	—	`conf`	Slice Normalized Dynamic Markov Logic Networks. StarAI@UAI Tivadar Papai, Henry A. Kautz, Daniel Stefankovic
2012	J	`jnl`	Subset Selection for Gaussian Markov Random Fields CoRR Satyaki Mahalanabis, Daniel Stefankovic
2012	J	`jnl`	The Complexity of Counting Eulerian Tours in 4-regular Graphs. Algorithmica Qi Ge, Daniel Stefankovic
2011	A	`conf`	Adjacent Crossings Do Matter. GD Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2011	A*	`conf`	An FPTAS for #Knapsack and Related Counting Problems. FOCS Parikshit Gopalan, Adam R. Klivans, Raghu Meka, Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda
2011	J	`jnl`	Crossing Numbers of Graphs with Rotation Systems. Algorithmica Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2011	J	`jnl`	Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species. SIAM J. Discret. Math. Daniel Stefankovic, Eric Vigoda
2011	B	`conf`	Hanani-Tutte and Monotone Drawings. WG Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2011	J	`jnl`	Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model CoRR Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang
2011	—	`conf`	Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. APPROX-RANDOM Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang
2011	A*	`conf`	Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. SODA Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang
2011	J	`jnl`	Spiraling and Folding: The Word View. Algorithmica Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
2010	J	`jnl`	A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions CoRR Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda
2010	—	`conf`	A graph polynomial for independent sets of bipartite graphs. FSTTCS Qi Ge, Daniel Stefankovic
2010	J	`jnl`	Fast Convergence of MCMC Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species CoRR Daniel Stefankovic, Eric Vigoda
2010	J	`jnl`	Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees CoRR Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang
2010	J	`jnl`	Removing Independently Even Crossings. SIAM J. Discret. Math. Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2010	J	`jnl`	The Complexity of Counting Eulerian Tours in 4-Regular Graphs CoRR Qi Ge, Daniel Stefankovic
2010	B	`conf`	The Complexity of Counting Eulerian Tours in 4-Regular Graphs. LATIN Qi Ge, Daniel Stefankovic
2009	J	`jnl`	A graph polynomial for independent sets of bipartite graphs CoRR Qi Ge, Daniel Stefankovic
2009	J	`jnl`	Adaptive simulated annealing: A near-optimal connection between sampling and counting. J. ACM Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda
2009	—	`conf`	Approximating L1-distances Between Mixture Distributions Using Random Projections. ANALCO Satyaki Mahalanabis, Daniel Stefankovic
2009	A	`conf`	Removing Independently Even Crossings. GD Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2009	J	`jnl`	Removing even crossings on surfaces. Eur. J. Comb. Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2008	J	`jnl`	Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems. SIAM J. Comput. Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda
2008	J	`jnl`	Approximating L1-distances between mixture distributions using random projections CoRR Satyaki Mahalanabis, Daniel Stefankovic
2008	—	`conf`	Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. CCCG Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
2008	A*	`conf`	Density Estimation in Linear Time. COLT Satyaki Mahalanabis, Daniel Stefankovic
2008	J	`jnl`	Odd Crossing Number and Crossing Number Are Not the Same. Discret. Comput. Geom. Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2007	A*	`conf`	Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. FOCS Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda
2007	J	`jnl`	Behavioral Shaping for Geometric Concepts. J. Mach. Learn. Res. Manu Chhabra, Robert A. Jacobs, Daniel Stefankovic
2007	A	`conf`	Crossing Number of Graphs with Rotation Systems. GD Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2007	A	`conf`	Crossing Numbers and Parameterized Complexity. GD Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2007	J	`jnl`	Density estimation in linear time CoRR Satyaki Mahalanabis, Daniel Stefankovic
2007	J	`jnl`	Folding and Spiralling: The Word View. Electron. Notes Discret. Math. Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
2007	J	`jnl`	Phylogeny of Mixture Models: Robustness of Maximum Likelihood and Non-Identifiable Distributions. J. Comput. Biol. Daniel Stefankovic, Eric Vigoda
2007	J	`jnl`	Removing Even Crossings on Surfaces. Electron. Notes Discret. Math. Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2007	J	`jnl`	Removing even crossings. J. Comb. Theory B Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2007	—	`conf`	Spiralling and Folding: The Topological View. CCCG Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
2007	J	`jnl`	Train Tracks and Confluent Drawings. Algorithmica Peter Hui, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2007	—	`conf`	Worst-Case Synchronous Grammar Rules. HLT-NAACL Daniel Gildea, Daniel Stefankovic
2006	A*	`conf`	Accelerating simulated annealing for the permanent and combinatorial counting problems. SODA Ivona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda
2006	J	`jnl`	Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting CoRR Daniel Stefankovic, Santosh S. Vempala, Eric Vigoda
2006	A	`conf`	Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. ESA Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda
2005	J	`jnl`	Locally testable cyclic codes. IEEE Trans. Inf. Theory László Babai, Amir Shpilka, Daniel Stefankovic
2005	A	`conf`	Odd Crossing Number Is Not Crossing Number. GD Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
2005	J	`jnl`	On the computational complexity of Nash equilibria for (0, 1) bimatrix games. Inf. Process. Lett. Bruno Codenotti, Daniel Stefankovic
2005	J	`jnl`	Solvability of Graph Inequalities. SIAM J. Discret. Math. Marcus Schaefer, Daniel Stefankovic
2004	J	`jnl`	Decidability of string graphs. J. Comput. Syst. Sci. Marcus Schaefer, Daniel Stefankovic
2004	A*	`conf`	Simultaneous diophantine approximation with excluded primes. SODA László Babai, Daniel Stefankovic
2004	A	`conf`	Train Tracks and Confluent Drawings. GD Peter Hui, Marcus Schaefer, Daniel Stefankovic
2003	A*	`conf`	Locally Testable Cyclic Codes. FOCS László Babai, Amir Shpilka, Daniel Stefankovic
2003	J	`jnl`	Recognizing string graphs in NP. J. Comput. Syst. Sci. Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
2002	Misc	`conf`	Algorithms for Normal Curves and Surfaces. COCOON Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
2002	A*	`conf`	Recognizing string graphs in NP. STOC Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
2001	A*	`conf`	Decidability of string graphs. STOC Marcus Schaefer, Daniel Stefankovic
2001	J	`jnl`	Set Systems with Restricted Intersections modulo Prime Powers. J. Comb. Theory A László Babai, Peter Frankl, Samuel Kutin, Daniel Stefankovic
2000	J	`jnl`	Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms. Inf. Process. Lett. Daniel Stefankovic
2000	J	`jnl`	On the complexity of multi-dimensional interval routing schemes. Theor. Comput. Sci. Peter Ruzicka, Daniel Stefankovic
2000	J	`jnl`	The complexity of shortest path and dilation bounded interval routing. Theor. Comput. Sci. Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic
1998	A	`conf`	Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks. DISC Rastislav Kralovic, Branislav Rovan, Peter Ruzicka, Daniel Stefankovic
1997	—	`conf`	The Complexity of Shortest Path and Dilation Bounded Interval Routing. Euro-Par Rastislav Kralovic, Peter Ruzicka, Daniel Stefankovic