Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kulkarni, Raghav"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Any monotone property of 3-uniform hypergraphs is weakly evasive
Raghav Kulkarni
,
Youming Qiao
,
Xiaoming Sun
Theoretical Computer Science
588
, 2015, pp. 16-23
Dynamic complexity of directed reachability and other problems
Samir Datta
,
William Hesse
,
Raghav Kulkarni
Lecture Notes in Computer Science
8572
, 2014, pp. 356-367
On the complexity of trial and error for constraint satisfaction problems
Gábor Ivanyos
,
Raghav Kulkarni
,
Youming Qiao
,
Miklos Santha
,
Aarthi Sundaram
Lecture Notes in Computer Science
8572
, 2014, pp. 663-675
Query complexity of matroids
Raghav Kulkarni
,
Miklos Santha
Lecture Notes in Computer Science
7878
, 2013, pp. 300-311
Improved bounds for bipartite matching on surfaces
Samir Datta
,
Arjun Gopalan
,
Raghav Kulkarni
,
Raghunath Tewari
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 254-265
Space complexity of perfect matching in bounded genus bipartite graphs
Samir Datta
,
Raghav Kulkarni
,
Raghunath Tewari
,
N.V. Vinodchandran
Journal of Computer and System Sciences
78
(3), 2012, pp. 765-779
Space complexity of perfect matching in bounded genus bipartite graphs
Samir Datta
,
Raghav Kulkarni
,
Raghunath Tewari
,
N. Variyam Vinodchandran
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 579-590
Evasiveness and the distribution of prime numbers
László Babai
,
Anandam Banerjee
,
Raghav Kulkarni
,
Vipul Naik
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 71-82
Deterministically isolating a perfect matching in bipartite planar graphs
Samir Datta
,
Raghav Kulkarni
,
Sambuddha Roy
Theory of Computing Systems
47
(3), 2010, pp. 737-757
Deterministically isolating a perfect matching in bipartite planar graphs
Samir Datta
,
Raghav Kulkarni
,
Sambuddha Roy
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 229-240
A new
NC
-algorithm for finding a perfect matching in
d
-regular bipartite graphs when
d
is small
Raghav Kulkarni
Lecture Notes in Computer Science
3998
, 2006, pp. 308-319
Seeking a vertex of the planar matching polytope in NC
Raghav Kulkarni
,
Meena Mahajan
Lecture Notes in Computer Science
3221
, 2004, pp. 472-483