| 51 |
Packing cycles in planar and bounded-genus graphs
Niklas Schlomberg, Hanjo Thiele, Jens Vygen
|
🔮
The Ethereal
|
math.CO
|
7 |
3 years ago |
| 52 |
Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas
Xi Chen, Anindya De, ... (+3 more)
|
🔮
The Ethereal
|
cs.CC
|
7 |
2 years ago |
| 53 |
Tight approximability of MAX 2-SAT and relatives, under UGC
Joshua Brakensiek, Neng Huang, Uri Zwick
|
🔮
The Ethereal
|
cs.CC
|
7 |
2 years ago |
| 54 |
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
Simon Döring, Dániel Marx, Philip Wellnitz
|
🔮
The Ethereal
|
cs.CC
|
7 |
1 year ago |
| 55 |
Multi-transversals for Triangles and the Tuza's Conjecture
Parinya Chalermsook, Samir Khuller, ... (+2 more)
|
🔮
The Ethereal
|
cs.DM
|
6 |
6 years ago |
| 56 |
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
Thomas Bläsius, Tobias Friedrich, ... (+3 more)
|
🔮
The Ethereal
|
cs.CC
|
6 |
5 years ago |
| 57 |
Tight Network Topology Dependent Bounds on Rounds of Communication
Arkadev Chattopadhyay, Michael Langberg, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
5 |
9 years ago |
| 58 |
Efficiently list-edge coloring multigraphs asymptotically optimally
Fotis Iliopoulos, Alistair Sinclair
|
🔮
The Ethereal
|
cs.DM
|
5 |
7 years ago |
| 59 |
Balanced Allocations with Heterogeneous Bins: The Power of Memory
Dimitrios Los, Thomas Sauerwald, John Sylvester
|
🔮
The Ethereal
|
cs.DM
|
5 |
3 years ago |
| 60 |
The Sharp Power Law of Local Search on Expanders
Simina Brânzei, Davin Choo, Nicholas Recker
|
🔮
The Ethereal
|
cs.CC
|
5 |
2 years ago |
| 61 |
Factoring Pattern-Free Permutations into Separable ones
Édouard Bonnet, Romain Bourneuf, ... (+2 more)
|
🔮
The Ethereal
|
math.CO
|
5 |
2 years ago |
| 62 |
Excluding Single-Crossing Matching Minors in Bipartite Graphs
Archontia C. Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht
|
🔮
The Ethereal
|
math.CO
|
4 |
3 years ago |
| 63 |
Relative-error monotonicity testing
Xi Chen, Anindya De, ... (+5 more)
|
🔮
The Ethereal
|
cs.CC
|
4 |
1 year ago |
| 64 |
Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
Charlie Carlson, Xiaoyu Chen, ... (+2 more)
|
🔮
The Ethereal
|
cs.DM
|
3 |
1 year ago |
| 65 |
Extended Formulation Lower Bounds for Refuting Random CSPs
Jonah Brown-Cohen, Prasad Raghavendra
|
🔮
The Ethereal
|
cs.CC
|
2 |
6 years ago |
| 66 |
On Testability of First-Order Properties in Bounded-Degree Graphs
Isolde Adler, Noleen Köhler, Pan Peng
|
🔮
The Ethereal
|
cs.LO
|
2 |
5 years ago |
| 67 |
The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid
Andreas Björklund, Petteri Kaski
|
🔮
The Ethereal
|
cs.CC
|
1 |
6 years ago |
| 68 |
Solving Polynomial Equations Over Finite Fields
Holger Dell, Anselm Haak, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
1 |
1 year ago |
| 69 |
Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite Expanders
Xue Chen
|
🔮
The Ethereal
|
cs.CC
|
0 |
10 years ago |
| 70 |
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
Feodor F. Dragan, Guillaume Ducoffe, ... (+2 more)
|
🔮
The Ethereal
|
cs.DM
|
0 |
8 years ago |
| 71 |
Coarse-Grained Complexity for Dynamic Algorithms
Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak
|
🔮
The Ethereal
|
cs.CC
|
0 |
6 years ago |
| 72 |
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
Édouard Bonnet, Julien Duron, ... (+3 more)
|
🔮
The Ethereal
|
math.CO
|
0 |
2 years ago |
| 73 |
Bounding $\varepsilon$-scatter dimension via metric sparsity
Romain Bourneuf, Marcin Pilipczuk
|
🔮
The Ethereal
|
cs.DM
|
0 |
1 year ago |
| 74 |
Nearly Tight Bounds on Testing of Metric Properties
Yiqiao Bao, Sampath Kannan, Erik Waingarten
|
🔮
The Ethereal
|
cs.DM
|
0 |
1 year ago |