default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical 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
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.
last updated on 2024-10-31 20:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
