![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Theoretical 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
![](https://dblp1.uni-trier.de/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.