Funder
German Research Foundation
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference21 articles.
1. Shortest two disjoint paths in polynomial time;Björklund;SIAM J. Comput.,2019
2. Adding one edge to planar graphs makes crossing number and 1-planarity hard;Cabello;SIAM J. Comput.,2013
3. Inserting a vertex into a planar graph;Chimani,2009
4. Inserting multiple edges into a planar graph;Chimani,2016
5. Parameterized Algorithms;Cygan,2015