Kasturi R. Varadarajan
Affiliations:- University of Iowa, Department of Computer Science
According to our database1,
Kasturi R. Varadarajan
authored at least 86 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on cs.uiowa.edu
On csauthors.net:
Bibliography
2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
2022
J. Comb. Optim., 2022
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022
2021
2020
Comput. Geom., 2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
2019
Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
2018
Proceedings of the 34th International Symposium on Computational Geometry, 2018
2017
A Unified Framework for Capacitated Covering Problems in Metric and Geometric Spaces.
CoRR, 2017
Proceedings of the 33rd International Symposium on Computational Geometry, 2017
2016
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
Proceedings of the 32nd International Symposium on Computational Geometry, 2016
2015
J. Comput. Geom., 2015
CoRR, 2015
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
2014
Proceedings of the Algorithms - ESA 2014, 2014
2013
Proceedings of the Symposium on Computational Geometry 2013, 2013
2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012
2011
ACM Trans. Algorithms, 2011
Discret. Comput. Geom., 2011
2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009
Proceedings of the Approximation, 2009
2008
The complexity of equilibria: Hardness results for economies via a correspondence with games.
Theor. Comput. Sci., 2008
An experimental study of different approaches to solve the market equilibrium problem.
ACM J. Exp. Algorithmics, 2008
Chic. J. Theor. Comput. Sci., 2008
Algorithmica, 2008
2007
Discret. Comput. Geom., 2007
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
2006
Equilibria for economies with production: constant-returns technologies and production planning constraints.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
2005
Electron. Colloquium Comput. Complex., 2005
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005
Proceedings of the Algorithms, 2005
2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004
2003
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003
2002
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
Proceedings of the 18th Annual Symposium on Computational Geometry, 2002
2001
A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects in <i>R</i><sup><i>d</i></sup>.
Discret. Comput. Geom., 2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
A tight bound on the number of geometric permutations of convex fat objects in R<sup>d</sup>.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001
2000
Discret. Comput. Geom., 2000
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
1998
I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
1996
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996