Person:196037: Difference between revisions

From MaRDI portal
Person:196037
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Daniel Štefanković to Daniel Štefanković: Duplicate
 
(No difference)

Latest revision as of 23:01, 8 December 2023

Available identifiers

zbMath Open stefankovic.danielMaRDI QIDQ196037

List of research outcomes

PublicationDate of PublicationType
Beyond the Existential Theory of the Reals2024-04-21Paper
https://portal.mardi4nfdi.de/entity/Q61473492024-01-15Paper
The Swendsen-Wang Dynamics on Trees2023-11-20Paper
The Swendsen–Wang dynamics on trees2023-10-23Paper
Lecture Notes on Spectral Independence and Bases of a Matroid: Local-to-Global and Trickle-Down from a Markov Chain Perspective2023-07-25Paper
Metastability of the Potts ferromagnet on random regular graphs2023-06-23Paper
https://portal.mardi4nfdi.de/entity/Q58755052023-02-03Paper
On mixing of Markov chains: coupling, spectral independence, and entropy factorization2022-12-08Paper
Implementations and the independent set polynomial below the Shearer threshold2022-11-17Paper
The hardness of sampling connected subgraphs2022-10-13Paper
https://portal.mardi4nfdi.de/entity/Q50911712022-07-21Paper
Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling2022-07-19Paper
The Degenerate Crossing Number and Higher-Genus Embeddings2022-06-28Paper
Spiraling and Folding: The Topological View2022-06-15Paper
The Complexity of Approximating the Matching Polynomial in the Complex Plane2022-03-22Paper
https://portal.mardi4nfdi.de/entity/Q51594242021-10-27Paper
https://portal.mardi4nfdi.de/entity/Q50095282021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50026262021-07-28Paper
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region2021-05-04Paper
Inapproximability of the Independent Set Polynomial in the Complex Plane2020-10-26Paper
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models2020-10-05Paper
https://portal.mardi4nfdi.de/entity/Q51113582020-05-27Paper
Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models2020-04-22Paper
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs2020-03-26Paper
On counting perfect matchings in general graphs2020-02-12Paper
Inapproximability of the independent set polynomial in the complex plane2019-08-22Paper
Approximation via Correlation Decay When Strong Spatial Mixing Fails2019-05-07Paper
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model2019-05-07Paper
Swendsen‐Wang algorithm on the mean‐field Potts model2019-02-20Paper
Structure Learning of $H$-colorings2019-02-06Paper
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region2018-08-02Paper
The complexity of tensor rank2018-07-23Paper
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs2018-04-22Paper
Sampling Random Colorings of Sparse Random Graphs2018-03-15Paper
https://portal.mardi4nfdi.de/entity/Q45981842017-12-19Paper
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models2017-10-10Paper
Spatial mixing and the connective constant: Optimal bounds2017-10-05Paper
https://portal.mardi4nfdi.de/entity/Q53650922017-09-29Paper
Swendsen-Wang Algorithm on the Mean-Field Potts Model2017-08-31Paper
Spatial mixing and the connective constant: optimal bounds2017-06-22Paper
Fixed points, Nash equilibria, and the existential theory of the reals2017-03-31Paper
https://portal.mardi4nfdi.de/entity/Q29696472017-03-22Paper
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results2017-03-22Paper
The Degenerate Crossing Number and Higher-Genus Embeddings2017-02-10Paper
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results2016-12-13Paper
Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms2016-06-16Paper
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region2016-04-18Paper
Adaptive simulated annealing: A near-optimal connection between sampling and counting2015-11-11Paper
https://portal.mardi4nfdi.de/entity/Q55013772015-08-03Paper
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region2015-06-26Paper
Decidability of string graphs2015-02-27Paper
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees2014-09-26Paper
Improved inapproximability results for counting independent sets in the hard-core model2014-08-25Paper
An FPTAS for #Knapsack and Related Counting Problems2014-07-30Paper
Block Additivity of ℤ2-Embeddings2013-12-20Paper
Hanani–Tutte, Monotone Drawings, and Level-Planarity2013-09-25Paper
Negative examples for sequential importance sampling of binary contingency tables2013-04-03Paper
Adjacent Crossings Do Matter2012-12-07Paper
A Graph Polynomial for Independent Sets of Bipartite Graphs2012-09-12Paper
https://portal.mardi4nfdi.de/entity/Q29088532012-08-29Paper
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions2012-08-10Paper
The complexity of counting Eulerian tours in 4-regular graphs2012-04-26Paper
Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species2012-03-15Paper
Adjacent Crossings Do Matter2012-03-09Paper
Hanani-Tutte and Monotone Drawings2011-12-16Paper
https://portal.mardi4nfdi.de/entity/Q31741432011-10-12Paper
Improved inapproximability results for counting independent sets in the hard-core model2011-08-17Paper
Crossing numbers of graphs with rotation systems2011-06-30Paper
Spiraling and folding: the word view2011-06-30Paper
Removing Independently Even Crossings2011-04-15Paper
Strong spatial mixing of $q$-colorings on Bethe lattices2011-02-14Paper
Accelerating simulated annealing for the permanent and combinatorial counting problems2010-08-16Paper
Recognizing string graphs in NP2010-08-05Paper
https://portal.mardi4nfdi.de/entity/Q35766692010-07-30Paper
The complexity of counting Eulerian tours in 4-regular graphs2010-04-27Paper
Removing Independently Even Crossings2010-04-27Paper
On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games2009-12-04Paper
Removing even crossings on surfaces2009-11-30Paper
https://portal.mardi4nfdi.de/entity/Q36199522009-04-14Paper
Locally Testable Cyclic Codes2008-12-21Paper
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems2008-10-28Paper
Removing Even Crossings on Surfaces2008-06-05Paper
Folding and Spiralling: The Word View2008-06-05Paper
Odd crossing number and crossing number are not the same2008-04-16Paper
Crossing Number of Graphs with Rotation Systems2008-03-25Paper
Crossing Numbers and Parameterized Complexity2008-03-25Paper
Negative examples for sequential importance sampling of binary contingency tables2008-03-11Paper
Removing even crossings2007-06-08Paper
Train tracks and confluent drawings2007-05-10Paper
Graph Drawing2006-11-13Paper
Solvability of Graph Inequalities2006-06-01Paper
Graph Drawing2005-12-07Paper
https://portal.mardi4nfdi.de/entity/Q53176722005-09-19Paper
Decidability of string graphs2004-11-22Paper
Recognizing string graphs in NP2004-11-18Paper
https://portal.mardi4nfdi.de/entity/Q48086572004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q45369372002-11-06Paper
Set systems with restricted intersections modulo prime powers2001-10-21Paper
The complexity of shortest path and dilation bounded interval routing2000-08-21Paper
On the complexity of multi-dimensional interval routing schemes2000-08-21Paper
Spiraling and Folding: The Topological View0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Daniel Štefanković