default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 513
Volume 513, November 2013
- Shinhaeng Jo, Jung-Heum Park
, Kyung-Yong Chwa:
Paired many-to-many disjoint path covers in faulty hypercubes. 1-24 - Santanu Kumar Dash, Sven-Bodo Scholz, Stephan Herhut, Bruce Christianson:
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs. 25-37 - Arash Farzan, J. Ian Munro:
Succinct encoding of arbitrary graphs. 38-52 - Robert Crowston, Gregory Z. Gutin, Mark Jones, Gabriele Muciaccia:
Maximum balanced subgraph problem parameterized above lower bound. 53-64 - Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. 65-76 - Przemyslaw Krysztowiak:
An improved approximation ratio for the jump number problem on interval orders. 77-84 - Jian Liu, Lusheng Chen:
On the relationships between perfect nonlinear functions and universal hash families. 85-95 - Angelo Monti:
Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game. 96-108 - Jérémy Barbay, Gonzalo Navarro:
On compressing permutations and adaptive sorting. 109-123
- Gregory Z. Gutin, Gabriele Muciaccia, Anders Yeo:
Parameterized complexity of k-Chinese Postman Problem. 124-128 - Simone Linz, Katherine St. John, Charles Semple:
Optimizing tree and character compatibility across several phylogenetic trees. 129-136
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-18 19:30 CEST 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:
