default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Vaz 0001
Person information
- affiliation: LAMSADE, Université Paris Dauphine - PSL, Paris, France
- affiliation (former): École Normale Supérieure, Paris, France
- affiliation (former): Technische Universität München, Germany
- affiliation (former): Max Planck Institute for Informatics (MPII), Saarbrücken, Germany
Other persons with the same name
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Parinya Chalermsook
, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz:
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Trans. Algorithms 20(1): 6:1-6:20 (2024)- [c8]Syamantak Das, Nikhil Kumar, Daniel Vaz:
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. MFCS 2024: 45:1-45:17 - [i7]Syamantak Das, Nikhil Kumar, Daniel Vaz:
Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs. CoRR abs/2407.09433 (2024) - 2022
- [j5]Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian:
On Approximating Degree-Bounded Network Design Problems. Algorithmica 84(5): 1252-1278 (2022) - [c7]Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz:
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. SWAT 2022: 10:1-10:21 - 2021
- [c6]Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. SODA 2021: 1206-1225 - [i6]Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz:
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. CoRR abs/2111.06299 (2021) - 2020
- [b1]Daniel Vaz:
Approximation algorithms for network design and cut problems in bounded-treewidth. Saarland University, Germany, 2020 - [c5]Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, Jiayi Xian:
On Approximating Degree-Bounded Network Design Problems. APPROX-RANDOM 2020: 39:1-39:21 - [i5]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. CoRR abs/2007.07862 (2020) - [i4]Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz:
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. CoRR abs/2008.12075 (2020)
2010 – 2019
- 2019
- [i3]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz:
Mimicking Networks Parameterized by Connectivity. CoRR abs/1910.10665 (2019) - 2018
- [j4]Martin Hoefer, Daniel Vaz, Lisa Wagner:
Dynamics in matching and coalition formation games with structural constraints. Artif. Intell. 262: 222-247 (2018) - [c4]Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz:
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. APPROX-RANDOM 2018: 8:1-8:19 - [i2]Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz:
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. CoRR abs/1802.10403 (2018) - 2017
- [c3]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz:
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. SODA 2017: 737-751 - 2016
- [j3]Parinya Chalermsook, Daniel Vaz:
A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set. Electron. Notes Discret. Math. 55: 113-116 (2016) - [c2]Parinya Chalermsook, Daniel Vaz:
New Integrality Gap Results for the Firefighters Problem on Trees. WAOA 2016: 65-77 - [i1]Parinya Chalermsook, Daniel Vaz:
New Integrality Gap Results for the Firefighters Problem on Trees. CoRR abs/1601.02388 (2016) - 2015
- [j2]Daniel Vaz, Luís Paquete, Carlos M. Fonseca, Kathrin Klamroth, Michael Stiglmayr:
Representation of the non-dominated set in biobjective discrete optimization. Comput. Oper. Res. 63: 172-186 (2015) - [c1]Martin Hoefer, Daniel Vaz, Lisa Wagner:
Hedonic Coalition Formation in Networks. AAAI 2015: 929-935 - 2013
- [j1]Daniel Vaz, Luís Paquete, Aníbal Ponte:
A note on the ϵ-indicator subset selection. Theor. Comput. Sci. 499: 113-116 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-18 20:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
