The location of median paths on grid graphs

By Becker Ronald  

Annals of Operations Research, Vol. 150, Iss. 1, 2007-03 ,pp. : 65-78

Springer Publishing Company

Access to resources Recommend Favorite

List edge multicoloring in graphs with few cycles

By Marx D.  

Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. : 85-90

Elsevier

Access to resources Recommend Favorite

On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group

By Schupp P.E.  

Theoretical Computer Science, Vol. 204, Iss. 1, 1998-09 ,pp. : 233-248

Elsevier

Access to resources Recommend Favorite

Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles

By Raman Venkatesh   Saurabh Saket  

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 203-225

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Scheduling for UET/UET-UCT Generalized n-Dimensional Grid Task Graphs

By Andronikos T.   Koziris N.   Papakonstantinou G.   Tsanakas P.  

Journal of Parallel and Distributed Computing, Vol. 57, Iss. 2, 1999-05 ,pp. : 140-165

Academic Press

Access to resources Recommend Favorite