Jack Dippel
https://orcid.org/0000-0002-8087-3009
Jack Dippel
Max Dupré la Tour
April Niu
Sanjukta Roy 0001
Adrian Vetta
Eliminating Majority Illusion Is Easy.
13763-13770
2025
AAAI
https://doi.org/10.1609/aaai.v39i13.33504
conf/aaai/2025
db/conf/aaai/aaai2025.html#DippelTN0V25
Jack Dippel
Austin Eide
Pawel Pralat
Daniel Willhalm
Playing Sudoku on random 3-regular graphs.
2025
March
abs/2503.07335
CoRR
https://doi.org/10.48550/arXiv.2503.07335
db/journals/corr/corr2503.html#abs-2503-07335
streams/journals/corr
Jack Dippel
Max Dupré la Tour
April Niu
Sanjukta Roy 0001
Adrian Vetta
Gerrymandering Planar Graphs.
463-471
2024
AAMAS
https://dl.acm.org/doi/10.5555/3635637.3662896
conf/atal/2024
db/conf/atal/aamas2024.html#DippelTNRV24
Jack Dippel
Adrian Vetta
One n Remains to Settle the Tree Conjecture.
28:1-28:16
2024
STACS
https://doi.org/10.4230/LIPIcs.STACS.2024.28
conf/stacs/2024
db/conf/stacs/stacs2024.html#DippelV24
Jack Dippel
Max Dupré la Tour
April Niu
Sanjukta Roy 0001
Adrian Vetta
Eliminating Majority Illusion is Easy.
2024
abs/2407.20187
CoRR
https://doi.org/10.48550/arXiv.2407.20187
db/journals/corr/corr2407.html#abs-2407-20187
streams/journals/corr
Joseph Cheriyan
Robert Cummings
Jack Dippel
Jasper Zhu
An Improved Approximation Algorithm for the Matching Augmentation Problem.
163-190
2023
March
37
SIAM J. Discret. Math.
1
https://doi.org/10.1137/21m1453505
db/journals/siamdm/siamdm37.html#CheriyanCDZ23
Jack Dippel
Adrian Vetta
One n Remains to Settle the Tree Conjecture.
2023
abs/2310.08663
CoRR
https://doi.org/10.48550/arXiv.2310.08663
db/journals/corr/corr2310.html#abs-2310-08663
Jack Dippel
Max Dupré la Tour
April Niu
Sanjukta Roy 0001
Adrian Vetta
Gerrymandering Planar Graphs.
2023
abs/2312.14721
CoRR
https://doi.org/10.48550/arXiv.2312.14721
db/journals/corr/corr2312.html#abs-2312-14721
Jack Dippel
Adrian Vetta
An Improved Bound for the Tree Conjecture in Network Creation Games.
241-257
2022
SAGT
https://doi.org/10.1007/978-3-031-15714-1_14
conf/sagt/2022
db/conf/sagt/sagt2022.html#DippelV22
Joseph Cheriyan
Robert Cummings
Jack Dippel
Jasper Zhu
An Improved Approximation Algorithm for the Matching Augmentation Problem.
38:1-38:17
2021
ISAAC
https://doi.org/10.4230/LIPIcs.ISAAC.2021.38
conf/isaac/2021
db/conf/isaac/isaac2021.html#CheriyanCDZ21
Jack Dippel
Adrian Vetta
An Improved Bound for the Tree Conjecture in Network Creation Games.
2021
abs/2106.05175
CoRR
https://arxiv.org/abs/2106.05175
db/journals/corr/corr2106.html#abs-2106-05175
Joe Cheriyan
Jack Dippel
Fabrizio Grandoni 0001
Arindam Khan 0001
Vishnu V. Narayan
The matching augmentation problem: a $\frac{7}{4}$-approximation algorithm.
315-354
2020
182
Math. Program.
1
https://doi.org/10.1007/s10107-019-01394-z
db/journals/mp/mp182.html#CheriyanDGKN20
Johannes Brustle
Jack Dippel
Vishnu V. Narayan
Mashbat Suzuki
Adrian Vetta
One Dollar Each Eliminates Envy.
23-39
2020
EC
https://doi.org/10.1145/3391403.3399447
conf/sigecom/2020
db/conf/sigecom/sigecom2020.html#BrustleDNSV20
Joseph Cheriyan
Robert Cummings
Jack Dippel
Jasper Zhu
An Improved Approximation Algorithm for the Matching Augmentation Problem.
2020
abs/2007.11559
CoRR
https://arxiv.org/abs/2007.11559
db/journals/corr/corr2007.html#abs-2007-11559
Johannes Brustle
Jack Dippel
Vishnu V. Narayan
Mashbat Suzuki
Adrian Vetta
One Dollar Each Eliminates Envy.
2019
abs/1912.02797
CoRR
http://arxiv.org/abs/1912.02797
db/journals/corr/corr1912.html#abs-1912-02797
Joe Cheriyan
Jack Dippel
Fabrizio Grandoni 0001
Arindam Khan 0001
Vishnu V. Narayan
The Matching Augmentation Problem: A 7/4-Approximation Algorithm.
2018
abs/1810.07816
CoRR
http://arxiv.org/abs/1810.07816
db/journals/corr/corr1810.html#abs-1810-07816
Johannes Brustle
Joseph CheriyanJoe Cheriyan
Robert Cummings
Austin Eide
Fabrizio Grandoni 0001
Arindam Khan 0001
Vishnu V. Narayan
April Niu
Pawel Pralat
Sanjukta Roy 0001
Mashbat Suzuki
Max Dupré la Tour
Adrian Vetta
Daniel Willhalm
Jasper Zhu