pdf-format: |
|
@Article{erickson_et_al:DR:2016:6722, author = {Jeff Erickson and Philip N. Klein and D{\'a}niel Marx and Claire Mathieu}, title = {{Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221)}}, pages = {94--116}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {6}, number = {5}, editor = {Jeff Erickson and Philip N. Klein and D{\'a}niel Marx and Claire Mathieu}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6722}, URN = {urn:nbn:de:0030-drops-67227}, doi = {10.4230/DagRep.6.5.94}, annote = {Keywords: Algorithms, planar graphs, theory, approximation, fixed-parameter tractable, network flow, network design, kernelization} }
Keywords: | Algorithms, planar graphs, theory, approximation, fixed-parameter tractable, network flow, network design, kernelization | |
Seminar: | Dagstuhl Reports, Volume 6, Issue 5 | |
Issue date: | 2016 | |
Date of publication: | 15.11.2016 |