Anil N. Hirani

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Bala Krishnamoorthy

> Home > Persons > Anil N. Hirani

Publications

2013
[i13]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1304-0664
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1304-0664
Tamal K. Dey, Anil N. Hirani, Bala Krishnamoorthy, Gavin W. Smith:
Edge Contractions and Simplicial Homology. CoRR abs/1304.0664 (2013)
2011
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/DeyHK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/DeyHK11
Tamal K. Dey, Anil N. Hirani, Bala Krishnamoorthy:
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming. SIAM J. Comput. 40(4): 1026-1044 (2011)
2010
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/DeyHK10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/DeyHK10
Tamal K. Dey, Anil N. Hirani, Bala Krishnamoorthy:
Optimal homologous cycles, total unimodularity, and linear programming. STOC 2010: 221-230
[i9]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1001-0338
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1001-0338
Tamal K. Dey, Anil N. Hirani, Bala Krishnamoorthy:
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming. CoRR abs/1001.0338 (2010)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.