Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Dippel, Jack
9  Ergebnisse:
Personensuche X
?
1

An Improved Bound for the Tree Conjecture in Network Creati..:

, In: Algorithmic Game Theory; Lecture Notes in Computer Science,
Dippel, Jack ; Vetta, Adrian - p. 241-257 , 2022
Link: https://doi.org/10.1007/..
 
?
2

One Dollar Each Eliminates Envy:

, In: Proceedings of the 21st ACM Conference on Economics and Computation,
Brustle, Johannes ; Dippel, Jack ; Narayan, Vishnu V... - p. 23-39 , 2020
Link: https://dl.acm.org/doi/1..
 
?
3

Gerrymandering Planar Graphs:

Dippel, Jack ; la Tour, Max Dupré ; Niu, April..
http://arxiv.org/abs/2312.14721.  , 2023
Link: http://arxiv.org/abs/231..
 
?
4

One n Remains to Settle the Tree Conjecture:

Dippel, Jack ; Vetta, Adrian
http://arxiv.org/abs/2310.08663.  , 2023
Link: http://arxiv.org/abs/231..
 
?
5

An Improved Bound for the Tree Conjecture in Network Creati..:

Dippel, Jack ; Vetta, Adrian
http://arxiv.org/abs/2106.05175.  , 2021
Link: http://arxiv.org/abs/210..
 
?
6

An Improved Approximation Algorithm for the Matching Augmen..:

Cheriyan, Joseph ; Cummings, Robert ; Dippel, Jack.
doi:10.4230/LIPIcs.ISAAC.2021.38.  , 2021
Link: https://doi.org/10.4230/..
 
?
7

One Dollar Each Eliminates Envy:

Brustle, Johannes ; Dippel, Jack ; Narayan, Vishnu V..
http://arxiv.org/abs/1912.02797.  , 2019
Link: http://arxiv.org/abs/191..
 
?
8

The Matching Augmentation Problem: A $\frac74$-Approximatio..:

Cheriyan, Joe ; Dippel, Jack ; Grandoni, Fabrizio..
http://arxiv.org/abs/1810.07816.  , 2018
Link: http://arxiv.org/abs/181..
 
?
9

Mattering the Invisible 

Technologies, Bodies, and the Realm of the Spectral 
Algranti, Miguel M. ; Dippel, Anne ; Hunter, Jack... , [2021]
Link: https://doi.org/10.1515/..
 
1-9