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
[2]
Hilfe
Suche: Author="Kavitha, Telikepalli"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New pairwise spanners
Telikepalli Kavitha
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 513-526
An improved approximation algorithm for the stable marriage problem with one-sided ties
Chien-Chung Huang
,
Telikepalli Kavitha
Lecture Notes in Computer Science
8494
, 2014, pp. 297-308
A size-popularity tradeoff in the stable marriage problem
Telikepalli Kavitha
SIAM Journal on Computing
43
(1), 2014, pp. 52-71
Dynamic matrix rank with partial lookahead
Telikepalli Kavitha
Theory of Computing Systems
55
(1), 2014, pp. 229-249
On pairwise spanners
Marek Cygan
,
Fabrizio Grandoni
,
Telikepalli Kavitha
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 209-220
Fair matchings and related problems
Chien-Chung Huang
,
Telikepalli Kavitha
,
Kurt Mehlhorn
,
Dimitrios Michail
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 339-350
Popular matchings in the stable marriage problem
Chien-Chung Huang
,
Telikepalli Kavitha
Information and Computation
222
, 2013, pp. 180-194
Near-popular matchings in the roommates problem
Chien-Chung Huang
,
Telikepalli Kavitha
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 43-62
Small stretch pairwise spanners
Telikepalli Kavitha
,
Nithin M. Varma
Lecture Notes in Computer Science
7965
, 2013, pp. 601-612
Timed lossy channel systems
Parosh Aziz Abdulla
,
Mohamed Faouzi Atig
,
Jonathan Cederberg
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 374-386
Algorithmic improvements of the Lovász local lemma via cluster expansion
Dimitris Achlioptas
,
Themis Gouleakis
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 16-23
Overlap of convex polytopes under rigid motion
Hee-Kap Ahn
,
Siu-Wing Cheng
,
Hyuk Jun Kweon
,
Juyoung Yon
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 498-509
Maintaining approximate maximum weighted matching in fully dynamic graphs
Abhash Anand
,
Surender Baswana
,
Manoj Gupta
,
Sandeep Sen
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 257-266
Computationally complete symbolic attacker in action
Gergei Bana
,
Pedro Adao
,
Hideki Sakurada
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 546-560
Decidable classes of documents for XPath
Vince Bárány
,
Mikolaj Bojanczyk
,
Diego Figueira
,
Pawel Parys
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 99-111
k
-delivery Traveling Salesman Problem on tree networks
Binay Bhattacharya
,
Yuzhuang Hu
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 325-336
Imperative programming in sets with atoms
Mikolaj Bojanczyk
,
Szymon Torunczyk
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 4-15
Approximate determinization of quantitative automata
Udi Boker
,
Thomas A. Henzinger
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 362-373
Extending the Rackoff technique to Affine nets
Rémi Bonnet
,
Alain Finkel
,
M. Praveen
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 301-312
Rerouting shortest paths in planar graphs
Paul Bonsma
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 337-349
Visibly rational expressions
Laura Bozzelli
,
César Sánchez
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 211-223
Verification of open interactive Markov chains
Tomas Brazdil
,
Holger Hermanns
,
Jan Krcal
,
Jan Kretinsky
,
Vojtech Rehak
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 474-485
On bisimilarity of higher-order pushdown automata: Undecidability at order two
Christopher Broadbent
,
Stefan Göller
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 160-172
The complexity of quantitative information flow in recursive programs
Rohit Chadha
,
Michael Ummels
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 534-545
Density functions subject to a co-matroid constraint
Venkatesan T. Chakaravarthy
,
Natwar Modani
,
Sivaramakrishnan R. Natarajan
,
Sambuddha Roy
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 236-248
Seiten 1
2
3
4
>