Arikati, S.R., A. Dessmark, A. Lingas and M.V. Marathe: Approximation algorithms for maximum two-dimensional pattern matching. In: Theoretical Computer Science 255, 51-62 (2001).
localid: C1256428004B93B8-6C1795FE8553898A00256D2000520DF6-ArikatiDessmarketal2001
Arikati, S.R., A. Dessmark, A. Lingas and M.V. Marathe: Approximation algorithms for maximum two-dimensional pattern matching. In: Theoretical Computer Science 255, 1/2, 51-62 (2001).
localid: C1256428004B93B8-6C1795FE8553898A00256D2000520DF6-ArikatiDessmarketal2001
Arikati, S.R. and K. Mehlhorn: A correctness certificate for the Stoer-Wagner min-cut algorithm. In: Information Processing Letters 70, 251-254 (1999).
localid: C1256428004B93B8-E77DC5FAFF8CE44EC12568AB00367ABD-Arikati-Mehlhorn
Arikati, S.R., S. Chaudhuri and C. Zaroliagis: All-Pairs Min-Cut in Sparse Networks. In: Journal of Algorithms 29, 82-110 (1998).
localid: C1256428004B93B8-4F5288722A23EA07C125672300615D50-Arikati-Chaudhuri-Zaroliagis-98
Arikati, S.R., A. Maheshwari and C. Zaroliagis: Efficient Computation of implicit representations of sparse graphs. In: Discrete Applied Mathematics 78, 1-3, 1-16 (1997).
localid: C1256428004B93B8-B2263DD6EDF22FCBC12565D80038C7F5-ArikatiMaheshwariZaroliagis97
Arikati, S. R., A. Dessmark, A. Lingas and M. V. Marathe: Approximation algorithms for maximum two-dimensional pattern matching. In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, (Eds.) Hirschberg, Dan; Myers, Gene. Lecture Notes in Computer Science. Springer, Berlin (1996) 348-360.
localid: C1256428004B93B8-40488A66FB99C851C12564840053FE43-Arikati-et-al96
Arikati, S.R., D.Z. Chen, L.P. Chew, G. Das, M. Smid and C. Zaroliagis: Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. In: Algorithms - ESA '96: 4th Annual European Symposium, (Eds.) Diaz, Josep; Serna, Maria. Lecture Notes in Computer Science. Springer, Berlin (1996) 514-528.
localid: C1256428004B93B8-BE9D285FD07505FAC125642F00511EBE-Zaroliagis96
Arikati, S.R. and A. Maheshwari: Realizing degree sequences in parallel. In: SIAM Journal of Computing 9, 2, 317-338 (1996).
localid: C1256428004B93B8-125FE9FBFDB8DF69C1256484004EC49E-Arikati-Maheshwari96
Arikati, S.R., S. Chaudhuri and C. Zaroliagis: All-Pairs Min-Cut in Sparse Networks. In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, (Eds.) Thiagarajan, P. S. Lecture Notes in Computer Science. Springer, Berlin, Germany (1995) 363-376.
localid: C1256428004B93B8-3919FBCEB2ABD315C125645900388276-Arikati-et-al95
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.