DROPS

Document

Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443)

Authors: Magnus Bordewich, Britta Dorn, Simone Linz, and Rolf Niedermeier

Published in: Dagstuhl Reports, Volume 9, Issue 10 (2020)

Abstract

Phylogenetics is the study of ancestral relationships between species. Its central goal is the reconstruction and analysis of phylogenetic trees and networks. Even though research in phylogenetics is motivated by biological questions and applications, it heavily relies on mathematics and computer science. Dagstuhl Seminar 19443 on Algorithms and Complexity in Phylogenetics aimed at bringing together researchers from phylogenetics and theoretical computer science to enable an exchange of expertise, facilitate interactions across both research areas, and establish new collaborations. This report documents the program and outcomes of the seminar. It contains an executive summary, abstracts of talks, short summaries of working groups, and a list of open problems that were posed during the seminar.

Cite as

Magnus Bordewich, Britta Dorn, Simone Linz, and Rolf Niedermeier. Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443). In Dagstuhl Reports, Volume 9, Issue 10, pp. 134-151, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@Article{bordewich_et_al:DagRep.9.10.134,
  author =	{Bordewich, Magnus and Dorn, Britta and Linz, Simone and Niedermeier, Rolf},
  title =	{{Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443)}},
  pages =	{134--151},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2020},
  volume =	{9},
  number =	{10},
  editor =	{Bordewich, Magnus and Dorn, Britta and Linz, Simone and Niedermeier, Rolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.9.10.134},
  URN =		{urn:nbn:de:0030-drops-118590},
  doi =		{10.4230/DagRep.9.10.134},
  annote =	{Keywords: Approximation algorithms, Evolution, Parameterized algorithms, Phylogenetic trees and networks}
}

Document

DOI: 10.4230/DagRep.5.6.1

Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241)

Authors: Craig Boutilier, Britta Dorn, Nicolas Maudet, and Vincent Merlin

Published in: Dagstuhl Reports, Volume 5, Issue 6 (2016)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 15241 "Computational Social Choice: Theory and Applications". The seminar featured a mixture of classic scientific talks (including three overview talks), open problem presentations, working group sessions, and five-minute contributions ("rump session"). While there were other seminars on related topics in the past, a special emphasis was put on practical applications in this edition.

Cite as

Craig Boutilier, Britta Dorn, Nicolas Maudet, and Vincent Merlin. Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241). In Dagstuhl Reports, Volume 5, Issue 6, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{boutilier_et_al:DagRep.5.6.1,
  author =	{Boutilier, Craig and Dorn, Britta and Maudet, Nicolas and Merlin, Vincent},
  title =	{{Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241)}},
  pages =	{1--27},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{6},
  editor =	{Boutilier, Craig and Dorn, Britta and Maudet, Nicolas and Merlin, Vincent},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.6.1},
  URN =		{urn:nbn:de:0030-drops-55050},
  doi =		{10.4230/DagRep.5.6.1},
  annote =	{Keywords: Computational Social Choice, Voting, Matching, Fair Division}
}

Search Results

Documents authored by Dorn, Britta

Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443)

Abstract

Cite as

Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241)

Abstract

Cite as

Thanks for your feedback!

Could not send message