Classified rank-maximal matchings and popular matchings: Algorithms and hardness.

Prajakta Nimbhorkar Chennai Mathematical Institute, Tamilnadu, India https://orcid.org/0000-0002-7601-9555 https://www.wikidata.org/entity/Q102378341 https://scholar.google.com/citations?user=hDBz3EUAAAAJ https://mathgenealogy.org/id.php?id=153430

Meghana Nasre Prajakta Nimbhorkar Nada Pulath Classified rank-maximal matchings and popular matchings: Algorithms and hardness. 2026 116058 1081 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2026.116058 db/journals/tcs/tcs1081.html#NasreNP26 streams/journals/tcs

Atasi Panda Harsh Sharma Anand Louis Prajakta Nimbhorkar Group Fair Matchings Using Convex Cost Functions. 17179-17187 2026 AAAI https://doi.org/10.1609/aaai.v40i20.38768 conf/aaai/2026 db/conf/aaai/aaai2026.html#PandaSLN26 Pratik Ghosal Vishwa Prakash HV Prajakta Nimbhorkar Nithin Varma 0001 (Almost Full) EFX for Three (and More) Types of Agents. 13889-13896 2025 AAAI https://doi.org/10.1609/aaai.v39i13.33519 conf/aaai/2025 db/conf/aaai/aaai2025.html#GhosalHN025 Harish Chandramouleeswaran Prajakta Nimbhorkar Nidhi Rathi Fair Division in a Variable Setting. 472-480 2025 AAMAS https://dl.acm.org/doi/10.5555/3709347.3743562 conf/ifaamas/2025 db/conf/ifaamas/aamas2025.html#Chandramouleeswaran25 Keshav Ranjan Meghana Nasre Prajakta Nimbhorkar Optimal Capacity Modification for Stable Matchings with Ties. 4023-4031 2025 IJCAI https://doi.org/10.24963/ijcai.2025/448 conf/ijcai/2025 db/conf/ijcai/ijcai2025.html#RanjanNN25 Vishwa Prakash HV Pratik Ghosal Prajakta Nimbhorkar Nithin Varma 0001 EFX Exists for Three Types of Agents. 101-128 2025 EC https://doi.org/10.1145/3736252.3742509 conf/sigecom/2025 db/conf/sigecom/sigecom2025.html#HVGN025

Atasi Panda Harsh Sharma Anand Louis Prajakta Nimbhorkar Group Fair Matchings using Convex Cost Functions. 2025 August abs/2508.12549 CoRR https://doi.org/10.48550/arXiv.2508.12549 db/journals/corr/corr2508.html#abs-2508-12549 streams/journals/corr

Vishwa Prakash HV Ruta Mehta Prajakta Nimbhorkar Almost and Approximate EFX for Few Types of Agents. 2025 August abs/2508.15380 CoRR https://doi.org/10.48550/arXiv.2508.15380 db/journals/corr/corr2508.html#abs-2508-15380 streams/journals/corr

Meghana Nasre Prajakta Nimbhorkar Keshav Ranjan Ankita Sarkar 0001 Popular critical matchings in the many-to-many setting. 114281 2024 January 982 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2023.114281 db/journals/tcs/tcs982.html#NasreNRS24

Vishwa Prakash HV Prajakta Nimbhorkar Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings. 780-788 2024 AAMAS https://dl.acm.org/doi/10.5555/3635637.3662931 conf/atal/2024 db/conf/atal/aamas2024.html#HVN24 Atasi Panda Anand Louis Prajakta Nimbhorkar Individual Fairness under Group Fairness Constraints in Bipartite Matching - One Framework to Approximate Them All. 175-183 2024 IJCAI https://www.ijcai.org/proceedings/2024/20 conf/ijcai/2024 db/conf/ijcai/ijcai2024.html#PandaLN24

Vishwa Prakash HV Pratik Ghosal Prajakta Nimbhorkar Nithin Varma 0001 EFX Exists for Three Types of Agents. 2024 abs/2410.13580 CoRR https://doi.org/10.48550/arXiv.2410.13580 db/journals/corr/corr2410.html#abs-2410-13580 streams/journals/corr

Harish Chandramouleeswaran Prajakta Nimbhorkar Nidhi Rathi Fair Division in a Variable Setting. 2024 abs/2410.14421 CoRR https://doi.org/10.48550/arXiv.2410.14421 db/journals/corr/corr2410.html#abs-2410-14421 streams/journals/corr

Keshav Ranjan Meghana Nasre Prajakta Nimbhorkar Optimal Capacity Modification for Strongly Stable Matchings. 2024 abs/2411.10284 CoRR https://doi.org/10.48550/arXiv.2411.10284 db/journals/corr/corr2411.html#abs-2411-10284 streams/journals/corr

Pranav Bisht Nikhil Gupta 0008 Prajakta Nimbhorkar Ilya Volkovich Launching Identity Testing into (Bounded) Space. TR24-041 2024 TR24 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2024/041 db/journals/eccc/eccc2024.html#Bisht0NV24

Prem Krishnaa Girija Limaye Meghana Nasre Prajakta Nimbhorkar Envy-freeness and relaxed stability: hardness and approximation algorithms. 41 2023 45 J. Comb. Optim. 1 https://doi.org/10.1007/s10878-022-00963-x db/journals/jco/jco45.html#KrishnaaLNN23

Anand Louis Meghana Nasre Prajakta Nimbhorkar Govind S. Sankar Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints. 1601-1608 2023 ECAI https://doi.org/10.3233/FAIA230442 conf/ecai/2023 db/conf/ecai/ecai2023.html#LouisNNS23 Aadityan Ganesh Pratik Ghosal Vishwa Prakash HV Prajakta Nimbhorkar Fair Healthcare Rationing to Maximize Dynamic Utilities. 231-242 2023 PAKDD (2) https://doi.org/10.1007/978-3-031-33377-4_18 conf/pakdd/2023-2 db/conf/pakdd/pakdd2023-2.html#GaneshGHN23 Meghana Nasre Prajakta Nimbhorkar Keshav Ranjan Critical Relaxed Stable Matchings with Two-Sided Ties. 447-461 2023 WG https://doi.org/10.1007/978-3-031-43380-1_32 conf/wg/2023 db/conf/wg/wg2023.html#NasreNR23

Pratik Ghosal Vishwa Prakash HV Prajakta Nimbhorkar Nithin Varma 0001 EFX Exists for Four Agents with Three Types of Valuations. 2023 abs/2301.10632 CoRR https://doi.org/10.48550/arXiv.2301.10632 db/journals/corr/corr2301.html#abs-2301-10632

Aadityan Ganesh Prajakta Nimbhorkar Pratik Ghosal Vishwa Prakash HV Fair Healthcare Rationing to Maximize Dynamic Utilities. 2023 abs/2303.11053 CoRR https://doi.org/10.48550/arXiv.2303.11053 db/journals/corr/corr2303.html#abs-2303-11053

Meghana Nasre Prajakta Nimbhorkar Keshav Ranjan Critical Relaxed Stable Matchings with Two-Sided Ties. 2023 abs/2303.12325 CoRR https://doi.org/10.48550/arXiv.2303.12325 db/journals/corr/corr2303.html#abs-2303-12325

Vishwa Prakash HV Prajakta Nimbhorkar Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings. 2023 abs/2312.15479 CoRR https://doi.org/10.48550/arXiv.2312.15479 db/journals/corr/corr2312.html#abs-2312-15479

Samir Datta Nutan Limaye Prajakta Nimbhorkar Thomas Thierauf Fabian Wagner Planar Graph Isomorphism Is in Log-Space. 8:1-8:33 2022 14 ACM Trans. Comput. Theory 2 https://doi.org/10.1145/3543686 db/journals/toct/toct14.html#DattaLNTW22

Kushagra Chatterjee Prajakta Nimbhorkar Popular Edges with Critical Nodes. 54:1-54:14 2022 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2022.54 conf/isaac/2022 db/conf/isaac/isaac2022.html#ChatterjeeN22

Meghana Nasre Prajakta Nimbhorkar Keshav Ranjan Popular Critical Matchings in the Many-to-Many Setting. 2022 abs/2206.12394 CoRR https://doi.org/10.48550/arXiv.2206.12394 db/journals/corr/corr2206.html#abs-2206-12394

Atasi Panda Anand Louis Prajakta Nimbhorkar Bipartite Matchings with Group Fairness and Individual Fairness Constraints. 2022 abs/2208.09951 CoRR https://doi.org/10.48550/arXiv.2208.09951 db/journals/corr/corr2208.html#abs-2208-09951

Govind S. Sankar Anand Louis Meghana Nasre Prajakta Nimbhorkar Matchings Under Diversity Constraints. 2022 abs/2208.11378 CoRR https://doi.org/10.48550/arXiv.2208.11378 db/journals/corr/corr2208.html#abs-2208-11378

Kushagra Chatterjee Prajakta Nimbhorkar Popular Edges with Critical Nodes. 2022 abs/2209.10805 CoRR https://doi.org/10.48550/arXiv.2209.10805 db/journals/corr/corr2209.html#abs-2209-10805

Meghana Nasre Prajakta Nimbhorkar Keshav Ranjan Ankita Sarkar 0001 Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas. 30:1-30:21 2021 FSTTCS https://doi.org/10.4230/LIPIcs.FSTTCS.2021.30 conf/fsttcs/2021 db/conf/fsttcs/fsttcs2021.html#NasreNRS21 Govind S. Sankar Anand Louis Meghana Nasre Prajakta Nimbhorkar Matchings with Group Fairness Constraints: Online and Offline Algorithms. 377-383 2021 IJCAI https://doi.org/10.24963/ijcai.2021/53 conf/ijcai/2021 db/conf/ijcai/ijcai2021.html#SankarLNN21 Aadityan Ganesh Vishwa Prakash HV Prajakta Nimbhorkar Geevarghese Philip Disjoint Stable Matchings in Linear Time. 94-105 2021 WG https://doi.org/10.1007/978-3-030-86838-3_7 conf/wg/2021 db/conf/wg/wg2021.html#GaneshHNP21

Govind S. Sankar Anand Louis Meghana Nasre Prajakta Nimbhorkar Matchings with Group Fairness Constraints: Online and Offline Algorithms. 2021 abs/2105.09522 CoRR https://arxiv.org/abs/2105.09522 db/journals/corr/corr2105.html#abs-2105-09522

Prem Krishnaa Girija Limaye Meghana Nasre Prajakta Nimbhorkar Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms. 193-208 2020 SAGT https://doi.org/10.1007/978-3-030-57980-7_13 conf/sagt/2020 db/conf/sagt/sagt2020.html#KrishnaaLNN20

Aadityan Ganesh Prajakta Nimbhorkar Geevarghese Philip Vishwa Prakash HV Disjoint Stable Matchings in Linear Time. 2020 abs/2011.13248 CoRR https://arxiv.org/abs/2011.13248 db/journals/corr/corr2011.html#abs-2011-13248

Prajakta Nimbhorkar V Arvind Rameshwar 0001 Dynamic rank-maximal and popular matchings. 523-545 2019 37 J. Comb. Optim. 2 https://doi.org/10.1007/s10878-018-0348-9 https://www.wikidata.org/entity/Q129247937 db/journals/jco/jco37.html#NimbhorkarV19

Pratik Ghosal Meghana Nasre Prajakta Nimbhorkar Rank-maximal matchings - structure and algorithms. 73-82 2019 767 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2018.09.033 db/journals/tcs/tcs767.html#GhosalNN19

Kavitha Gopal Meghana Nasre Prajakta Nimbhorkar T. Pradeep Reddy Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties. 193-205 2019 COCOON https://doi.org/10.1007/978-3-030-26176-4_16 conf/cocoon/2019 db/conf/cocoon/cocoon2019.html#GopalNNR19 Meghana Nasre Prajakta Nimbhorkar Nada Pulath Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness. 244-257 2019 WG https://doi.org/10.1007/978-3-030-30786-8_19 conf/wg/2019 db/conf/wg/wg2019.html#NasreNP19

Prem Krishnaa Girija Limaye Meghana Nasre Prajakta Nimbhorkar Maximum-Size Envy-free Matchings. 2019 abs/1910.07159 CoRR http://arxiv.org/abs/1910.07159 db/journals/corr/corr1910.html#abs-1910-07159

Vikraman Arvind Partha Mukhopadhyay Prajakta Nimbhorkar Yadu Vasudev Expanding Generating Sets for Solvable Permutation Groups. 1721-1740 2018 32 SIAM J. Discret. Math. 3 https://doi.org/10.1137/17M1148979 https://www.wikidata.org/entity/Q129510987 db/journals/siamdm/siamdm32.html#ArvindMNV18

Krishnapriya A. M Meghana Nasre Prajakta Nimbhorkar Amit Rawat How Good Are Popular Matchings?. 9:1-9:14 2018 SEA https://doi.org/10.4230/LIPIcs.SEA.2018.9 conf/wea/2018 db/conf/wea/sea2018.html#MNNR18

Krishnapriya A. M Meghana Nasre Prajakta Nimbhorkar Amit Rawat How good are Popular Matchings? 2018 abs/1805.01311 CoRR http://arxiv.org/abs/1805.01311 db/journals/corr/corr1805.html#abs-1805-01311

Meghana Nasre Prajakta Nimbhorkar Nada Pulath Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings. 2018 abs/1805.02851 CoRR http://arxiv.org/abs/1805.02851 db/journals/corr/corr1805.html#abs-1805-02851

Meena Mahajan Prajakta Nimbhorkar Anuj Tawari Computing the maximum using (min, +) formulas. TR18-020 2018 TR18 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2018/020 db/journals/eccc/eccc25.html#MahajanNT18

Meena Mahajan Prajakta Nimbhorkar Anuj Tawari Shortest path length with bounded-alternation (min, +) formulas. TR18-146 2018 TR18 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2018/146 db/journals/eccc/eccc25.html#MahajanNT18a

Prajakta Nimbhorkar V Arvind Rameshwar 0001 Dynamic Rank-Maximal Matchings. 433-444 2017 COCOON https://doi.org/10.1007/978-3-319-62389-4_36 conf/cocoon/2017 db/conf/cocoon/cocoon2017.html#NimbhorkarV17 Meghana Nasre Prajakta Nimbhorkar Popular Matchings with Lower Quotas. 44:1-44:15 2017 FSTTCS https://doi.org/10.4230/LIPIcs.FSTTCS.2017.44 conf/fsttcs/2017 db/conf/fsttcs/fsttcs2017.html#NasreN17 Meena Mahajan Prajakta Nimbhorkar Anuj Tawari Computing the Maximum using (min, +) Formulas. 74:1-74:11 2017 MFCS https://doi.org/10.4230/LIPIcs.MFCS.2017.74 conf/mfcs/2017 db/conf/mfcs/mfcs2017.html#MahajanNT17

Prajakta Nimbhorkar V Arvind Rameshwar 0001 Dynamic Rank Maximal Matchings. 2017 abs/1704.00899 CoRR http://arxiv.org/abs/1704.00899 db/journals/corr/corr1704.html#NimbhorkarV17

Meghana Nasre Prajakta Nimbhorkar Popular Matching with Lower Quotas. 2017 abs/1704.07546 CoRR http://arxiv.org/abs/1704.07546 db/journals/corr/corr1704.html#NasreN17

Telikepalli Kavitha Meghana Nasre Prajakta Nimbhorkar Popularity at minimum cost. 574-596 2014 27 J. Comb. Optim. 3 https://doi.org/10.1007/s10878-012-9537-0 https://www.wikidata.org/entity/Q62045773 db/journals/jco/jco27.html#KavithaNN14

Pratik Ghosal Meghana Nasre Prajakta Nimbhorkar Rank-Maximal Matchings - Structure and Algorithms. 593-605 2014 ISAAC https://doi.org/10.1007/978-3-319-13075-0_47 https://www.wikidata.org/entity/Q62045775 conf/isaac/2014 db/conf/isaac/isaac2014.html#GhoshalNN14

Pratik Ghosal Meghana Nasre Prajakta Nimbhorkar Rank Maximal Matchings - Structure and Algorithms. 2014 abs/1409.4977 CoRR http://arxiv.org/abs/1409.4977 db/journals/corr/corr1409.html#GhoshalNN14

Bireswar Das Samir Datta Prajakta Nimbhorkar Log-Space Algorithms for Paths and Matchings in k-Trees. 669-689 2013 53 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-013-9469-9 db/journals/mst/mst53.html#DasDN13

Meena Mahajan Prajakta Nimbhorkar Kasturi R. Varadarajan The planar k-means problem is NP-hard. 13-21 2012 442 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2010.05.034 db/journals/tcs/tcs442.html#MahajanNV12

Vikraman Arvind Partha Mukhopadhyay Prajakta Nimbhorkar Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs. 37-48 2012 LATIN https://doi.org/10.1007/978-3-642-29344-3_4 conf/latin/2012 db/conf/latin/latin2012.html#ArvindMN12 Vikraman Arvind Partha Mukhopadhyay Prajakta Nimbhorkar Yadu Vasudev Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. 112-123 2012 MFCS https://doi.org/10.1007/978-3-642-32589-2_13 conf/mfcs/2012 db/conf/mfcs/mfcs2012.html#ArvindMNV12

Vikraman Arvind Partha Mukhopadhyay Prajakta Nimbhorkar Yadu Vasudev Near-Optimal Expanding Generating Sets for Solvable Permutation Groups http://arxiv.org/abs/1201.3181 2012 CoRR abs/1201.3181 db/journals/corr/corr1201.html#abs-1201-3181

Michal Koucký 0001 Prajakta Nimbhorkar Pavel Pudlák Pseudorandom generators for group products: extended abstract. 263-272 2011 STOC https://doi.org/10.1145/1993636.1993672 conf/stoc/2011 db/conf/stoc/stoc2011.html#KouckyNP11

Vikraman Arvind Partha Mukhopadhyay Prajakta Nimbhorkar Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs. TR11-081 2011 TR11 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2011/081 db/journals/eccc/eccc18.html#ArvindMN11

Vikraman Arvind Partha Mukhopadhyay Prajakta Nimbhorkar Yadu Vasudev Expanding Generator Sets for Solvable Permutation Groups. TR11-140 2011 TR11 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2011/140 db/journals/eccc/eccc18.html#ArvindMNV11

Nutan Limaye Meena Mahajan Prajakta Nimbhorkar Longest Paths in Planar DAGs in Unambiguous Log-Space. 2010 2010 Chic. J. Theor. Comput. Sci. http://cjtcs.cs.uchicago.edu/articles/CATS2009/5/contents.html db/journals/cjtcs/cjtcs2010.html#LimayeMN10

Telikepalli Kavitha Meghana Nasre Prajakta Nimbhorkar Popularity at Minimum Cost. 145-156 2010 ISAAC (1) https://doi.org/10.1007/978-3-642-17517-6_15 https://www.wikidata.org/entity/Q62045784 conf/isaac/2010-1 db/conf/isaac/isaac2010-1.html#KavithaNN10 Bireswar Das Samir Datta Prajakta Nimbhorkar Log-space Algorithms for Paths and Matchings in k-trees. 215-226 2010 STACS https://doi.org/10.4230/LIPIcs.STACS.2010.2456 conf/stacs/2010 db/conf/stacs/stacs2010.html#DasDN10

Telikepalli Kavitha Meghana Nasre Prajakta Nimbhorkar Popularity at Minimum Cost http://arxiv.org/abs/1009.2591 2010 CoRR abs/1009.2591 db/journals/corr/corr1009.html#abs-1009-2591

Samir Datta Prajakta Nimbhorkar Thomas Thierauf Fabian Wagner Graph Isomorphism for K<sub>3,3</sub>-free and K<sub>5</sub>-free graphs is in Log-space. TR10-050 2010 TR10 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2010/050 db/journals/eccc/eccc17.html#DattaNTW10

Michal Koucký 0001 Prajakta Nimbhorkar Pavel Pudlák Pseudorandom Generators for Group Products. TR10-113 2010 TR10 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2010/113 db/journals/eccc/eccc17.html#KouckyNP10

Nutan Limaye Meena Mahajan Prajakta Nimbhorkar Longest Paths in Planar DAGs in Unambiguous Logspace. 99-105 2009 CATS http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV94Limaye.html conf/cats/2009 db/conf/cats/cats2009.html#LimayeMN09 Samir Datta Nutan Limaye Prajakta Nimbhorkar Thomas Thierauf Fabian Wagner Planar Graph Isomorphism is in Log-Space. 203-214 2009 CCC https://doi.org/10.1109/CCC.2009.16 https://doi.ieeecomputersociety.org/10.1109/CCC.2009.16 https://www.wikidata.org/entity/Q56783670 conf/coco/2009 db/conf/coco/coco2009.html#DattaLNTW09 Samir Datta Prajakta Nimbhorkar Thomas Thierauf Fabian Wagner Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. 145-156 2009 FSTTCS https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2314 conf/fsttcs/2009 db/conf/fsttcs/fsttcs2009.html#DattaNTW09 Meena Mahajan Prajakta Nimbhorkar Kasturi R. Varadarajan The Planar k-Means Problem is NP-Hard. 274-285 2009 WALCOM https://doi.org/10.1007/978-3-642-00202-1_24 https://www.wikidata.org/entity/Q56449832 conf/walcom/2009 db/conf/walcom/walcom2009.html#MahajanNV09 Samir Datta Nutan Limaye Prajakta Nimbhorkar Thomas Thierauf Fabian Wagner Planar Graph Isomorphism is in Log-Space. 2009 Algebraic Methods in Computational Complexity http://drops.dagstuhl.de/opus/volltexte/2010/2416/ conf/dagstuhl/2009P9421 db/conf/dagstuhl/P9421.html#DattaLNTW09

Bireswar Das Samir Datta Prajakta Nimbhorkar Log-space Algorithms for Paths and Matchings in k-trees http://arxiv.org/abs/0912.4602 2009 CoRR abs/0912.4602 db/journals/corr/corr0912.html#abs-0912-4602

Fabian Wagner Samir Datta Nutan Limaye Prajakta Nimbhorkar Thomas Thierauf Planar Graph Isomorphism is in Log-space. TR09-052 2009 TR09 Electron. Colloquium Comput. Complex. https://eccc.weizmann.ac.il/report/2009/052 db/journals/eccc/eccc16.html#WagnerDLNT09

Samir Datta Nutan Limaye Prajakta Nimbhorkar 3-connected Planar Graph Isomorphism is in Log-space. 2008 FSTTCS https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1749 conf/fsttcs/2008 db/conf/fsttcs/fsttcs2008.html#DattaLN08 155-162

Nutan Limaye Meena Mahajan Prajakta Nimbhorkar Longest paths in Planar DAGs in Unambiguous Logspace http://arxiv.org/abs/0802.1699 2008 CoRR abs/0802.1699 db/journals/corr/corr0802.html#abs-0802-1699

Samir Datta Nutan Limaye Prajakta Nimbhorkar 3-connected Planar Graph Isomorphism is in Log-space http://arxiv.org/abs/0806.1041 2008 CoRR abs/0806.1041 db/journals/corr/corr0806.html#abs-0806-1041

Samir Datta Nutan Limaye Prajakta Nimbhorkar Thomas Thierauf Fabian Wagner A Log-space Algorithm for Canonization of Planar Graphs http://arxiv.org/abs/0809.2319 2008 CoRR abs/0809.2319 db/journals/corr/corr0809.html#abs-0809-2319

Vikraman Arvind Pranav Bisht Harish Chandramouleeswaran Kushagra Chatterjee Bireswar Das Samir Datta Aadityan Ganesh Pratik Ghosal Kavitha Gopal Nikhil Gupta 0008 Vishwa Prakash HV Telikepalli Kavitha Michal Koucký 0001 Prem Krishnaa Girija Limaye Nutan Limaye Anand Louis Krishnapriya A. M Meena Mahajan Ruta Mehta Partha Mukhopadhyay Meghana Nasre Atasi Panda Geevarghese Philip Pavel Pudlák Nada Pulath V Arvind Rameshwar 0001 Keshav Ranjan Nidhi Rathi Amit Rawat T. Pradeep Reddy Govind S. Sankar Ankita Sarkar 0001 Harsh Sharma Anuj Tawari Thomas Thierauf Kasturi R. Varadarajan Nithin Varma 0001 Yadu Vasudev Ilya Volkovich Fabian Wagner