#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2010

2018

- This year (3)
- Last 5 years (10)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Daniel Vaz, LuÃs Paquete, AnÃbal Ponte
- Theor. Comput. Sci.
- 2013

The -indicator subset selection selects a subset of a nondominated point set that is as close as possible to a reference point set with respect to the -indicator. This selection procedure is used byâ€¦ (More)

- Daniel Vaz, LuÃs Paquete, Carlos M. Fonseca, Kathrin Klamroth, Michael Stiglmayr
- Computers & OR
- 2015

This article introduces several algorithms for finding a representative subset of the non-dominated point set of a biobjective discrete optimization problem with respect to uniformity, coverage andâ€¦ (More)

- Parinya Chalermsook, Daniel Vaz
- WAOA
- 2016

In the firefighter problem on trees, we are given a tree G = (V,E) together with a vertex s âˆˆ V where the fire starts spreading. At each time step, the firefighters can pick one vertex while the fireâ€¦ (More)

- Daniel Vaz, Roberto Santos Inoue, Valdir Grassi Jr.
- 2010 Latin American Robotics Symposium andâ€¦
- 2010

Motion planning is one of the fundamental problems in autonomous robotic navigation. However, usually the dynamic model of the robot is not considered on most of the basic motion planners, resultingâ€¦ (More)

The Group Steiner Tree (GST) problem is a classical problem in combinatorial optimization and theoretical computer science. In the Edge-Weighted Group Steiner Tree (EWGST) problem, we are given anâ€¦ (More)

- Parinya Chalermsook, Daniel Vaz
- Electronic Notes in Discrete Mathematics
- 2016

We prove a tight connection between two important notions in combinatorial optimization. Let G be a graph class (i.e. a subset of all graphs) and r(G) = supGâˆˆG Ï‡f (G) Ï‰(G) where Ï‡f (G) and Ï‰(G) areâ€¦ (More)

a EPIUnit Instituto de SaÃºde PÃºblica, Universidade do Porto, Rua das Taipas, n 135, 4050-600 Porto, Portugal b ServiÃ§o de NutriÃ§Ã£o e DietÃ©tica, Centro Hospitalar de Vila Nova de Gaia/Espinho, Ruaâ€¦ (More)

The Group Steiner Tree (GST) problem is a classical problem in combinatorial optimization and theoretical computer science. In the Edge-Weighted Group Steiner Tree (EWGST) problem, we are given anâ€¦ (More)

- Martin Hoefer, Daniel Vaz, Lisa Wagner
- Artif. Intell.
- 2018

Matching and coalition formation are fundamental aspects in the organization of many multiagent systems. In large populations, the emergence of coalitions is often restricted by structuralâ€¦ (More)

- Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz
- APPROX-RANDOM
- 2018

In the Group Steiner Tree problem (GST), we are given a (edge or vertex)-weighted graph G = (V,E) on n vertices, together with a root vertex r and a collection of groups {Si}iâˆˆ[h] : Si âŠ† V (G). Theâ€¦ (More)