![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 571
Volume 571, March 2015
- Patrizio Angelini
, Giordano Da Lozzo
, Giuseppe Di Battista
, Fabrizio Frati
, Vincenzo Roselli
:
The importance of being proper: (In clustered-level planarity and T-level planarity). 1-9 - Cheng-Nan Lai:
On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups. 10-20 - Piotr Krysta, Carmine Ventre
:
Combinatorial auctions with verification are tractable. 21-35 - Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner
, Kathrin Hanauer:
Upward planar graphs and their duals. 36-49 - Wojciech Rytter, Arseny M. Shur:
Searching for Zimin patterns. 50-57 - Limin Wang, Xiaoyan Zhang, Zhao Zhang, Hajo Broersma
:
A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs. 58-66 - Christophe Crespelle, Thi Ha Duong Phan, The Hung Tran:
Termination of the iterated strong-factor operator on multipartite graphs. 67-77 - Stephane Durocher, Debajyoti Mondal, Md. Saidur Rahman
:
On graphs that are not PCGs. 78-87
![](https://dblp.org/img/cog.dark.24x24.png)
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.