The following pages link to Daniel Štefanković (Q196037):
Displaying 50 items.
- (Q269468) (redirect page) (← links)
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
- Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms (Q294745) (← links)
- Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- Spiraling and folding: the word view (Q548656) (← links)
- The complexity of tensor rank (Q722207) (← links)
- (Q879958) (redirect page) (← links)
- Train tracks and confluent drawings (Q879959) (← links)
- Removing even crossings (Q885288) (← links)
- Removing even crossings on surfaces (Q1039443) (← links)
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739) (← links)
- (Q1575667) (redirect page) (← links)
- The complexity of shortest path and dilation bounded interval routing (Q1575668) (← links)
- On the complexity of multi-dimensional interval routing schemes (Q1575745) (← links)
- Decidability of string graphs (Q1887714) (← links)
- Negative examples for sequential importance sampling of binary contingency tables (Q1945173) (← links)
- The hardness of sampling connected subgraphs (Q2081646) (← links)
- Implementations and the independent set polynomial below the Shearer threshold (Q2098180) (← links)
- On mixing of Markov chains: coupling, spectral independence, and entropy factorization (Q2105155) (← links)
- On counting perfect matchings in general graphs (Q2294743) (← links)
- Spatial mixing and the connective constant: optimal bounds (Q2359740) (← links)
- The complexity of counting Eulerian tours in 4-regular graphs (Q2429360) (← links)
- Odd crossing number and crossing number are not the same (Q2482214) (← links)
- Hanani–Tutte, Monotone Drawings, and Level-Planarity (Q2849807) (← links)
- Block Additivity of ℤ2-Embeddings (Q2867656) (← links)
- Improved inapproximability results for counting independent sets in the hard-core model (Q2877770) (← links)
- A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions (Q2903521) (← links)
- (Q2908853) (← links)
- A Graph Polynomial for Independent Sets of Bipartite Graphs (Q2911069) (← links)
- The Degenerate Crossing Number and Higher-Genus Embeddings (Q2959743) (← links)
- (Q2969647) (← links)
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results (Q2969655) (← links)
- Hanani-Tutte and Monotone Drawings (Q3104784) (← links)
- (Q3174143) (← links)
- Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region (Q3177756) (← links)
- Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees (Q3192167) (← links)
- Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species (Q3225114) (← links)
- Adaptive simulated annealing: A near-optimal connection between sampling and counting (Q3452215) (← links)
- Removing Even Crossings on Surfaces (Q3503455) (← links)
- Folding and Spiralling: The Word View (Q3503458) (← links)
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems (Q3532571) (← links)
- Locally Testable Cyclic Codes (Q3546520) (← links)
- Removing Independently Even Crossings (Q3557878) (← links)
- (Q3576669) (← links)
- Accelerating simulated annealing for the permanent and combinatorial counting problems (Q3581599) (← links)
- (Q3619952) (← links)
- (Q4536937) (← links)
- (Q4598184) (← links)
- Sampling Random Colorings of Sparse Random Graphs (Q4608004) (← links)
