Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Hegde, Rajneesh
8  Ergebnisse:
Personensuche X
?
1

Non-embeddable extensions of embedded minors:

Hegde, Rajneesh ; Thomas, Robin
Journal of Combinatorial Theory, Series B.  131 (2018)  - p. 55-84 , 2018
Link: https://doi.org/10.1016/..
 
?
2

Deterministic pivoting algorithms for constrained ranking a..:

, In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms,
van Zuylen, Anke ; Hegde, Rajneesh ; Jain, Kamal. - p. 405-414 , 2007
Link: https://dl.acm.org/doi/1..
 
?
3

The Hardness of Approximating Poset Dimension:

Hegde, Rajneesh ; Jain, Kamal
Electronic Notes in Discrete Mathematics.  29 (2007)  - p. 435-443 , 2007
Link: https://doi.org/10.1016/..
 
?
4

Finding 3-shredders efficiently:

Hegde, Rajneesh
ACM Transactions on Algorithms.  2 (2006)  1 - p. 14-43 , 2006
Link: https://doi.org/10.1145/..
 
?
5

Finding 3-shredders efficiently:

Hegde, Rajneesh
ACM Transactions on Algorithms (TALG).  2 (2006)  1 - p. 14-43 , 2006
Link: https://dl.acm.org/doi/1..
 
?
6

Non-Embeddable Extensions of Embedded Minors:

Hegde, Rajneesh ; Thomas, Robin
http://arxiv.org/abs/1401.2973.  , 2014
Link: http://arxiv.org/abs/140..
 
?
7

A Min-Max theorem about the Road Coloring Conjecture:

Hegde, Rajneesh ; Jain, Kamal
hal-01184444.  , 2005
Link: https://hal.inria.fr/hal..
 
?
8

A Min-Max theorem about the Road Coloring Conjecture:

Rajneesh Hegde ; Kamal Jain
https://dmtcs.episciences.org/3455/pdf.  , 2005
Link: https://doi.org/10.46298..
 
1-8