A. Slivkins. Parameterized Tractability of Edge-Disjoint Paths on DAGs. In Proceedings of the 11th Annual European Symposium on Algorithms , 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Research Statement -- Aleksandrs Slivkins - My Research Interests Self-citation (Slivkins) (Correct)
No context found.
A. Slivkins. Parameterized Tractability of Edge-Disjoint Paths on DAGs. In Proceedings of the 11th Annual European Symposium on Algorithms , 2003.
Parameterized Coloring Problems on Chordal Graphs - Marx (Correct)
No context found.
A. Slivkins. Parameterized tractability of edge-disjoint paths on directed acyclic graphs. In Algorithms -- ESA 2003, 11th Annual European Symposium, volume 2832 of Lecture Notes in Comput. Sci., pages 482--493. Springer, Berlin, 2003. 12
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC