Optimal Homologous Cycles, Total Unimodularity, and Linear Programming

Article Properties
Cite
Dey, Tamal K., et al. “Optimal Homologous Cycles, Total Unimodularity, and Linear Programming”. SIAM Journal on Computing, vol. 40, no. 4, 2011, pp. 1026-44, https://doi.org/10.1137/100800245.
Dey, T. K., Hirani, A. N., & Krishnamoorthy, B. (2011). Optimal Homologous Cycles, Total Unimodularity, and Linear Programming. SIAM Journal on Computing, 40(4), 1026-1044. https://doi.org/10.1137/100800245
Dey, Tamal K., Anil N. Hirani, and Bala Krishnamoorthy. “Optimal Homologous Cycles, Total Unimodularity, and Linear Programming”. SIAM Journal on Computing 40, no. 4 (2011): 1026-44. https://doi.org/10.1137/100800245.
Dey TK, Hirani AN, Krishnamoorthy B. Optimal Homologous Cycles, Total Unimodularity, and Linear Programming. SIAM Journal on Computing. 2011;40(4):1026-44.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
Title Notices of the American Mathematical Society 2007
Measuring and computing natural generators for homology groups Computational Geometry
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
 15 2010
Integral Extreme Points SIAM Review
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
 37 1968
10.1016/0095-8956(92)90045-Y
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs

 Operations Research
  • Technology: Manufactures: Production management. Operations management
  • Social Sciences: Commerce: Business: Personnel management. Employment management
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
 193 1986
Citations
Title Journal Journal Categories Citations Publication Date
Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants

 Algorithms for Molecular Biology
  • Science: Biology (General): Genetics
  • Science: Chemistry: Organic chemistry: Biochemistry
  • Technology: Chemical technology: Biotechnology
  • Medicine: Medicine (General): Computer applications to medicine. Medical informatics
  • Science: Biology (General)
  • Science: Biology (General): Genetics
 2024
Field Choice Problem in Persistent Homology

 Discrete & Computational Geometry
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
 2023
Stable volumes for persistent homology

 Journal of Applied and Computational Topology 1 2023
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus Computational Geometry
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
 2023
Fast Computation of Neck-Like Features IEEE Transactions on Visualization and Computer Graphics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2023
Citations Analysis
Category Category Repetition
Science: Mathematics11
Science: Mathematics: Instruments and machines: Electronic computers. Computer science11
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods9
Technology: Engineering (General). Civil engineering (General)7
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software6
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware6
Medicine: Medicine (General): Computer applications to medicine. Medical informatics4
Science: Biology (General)4
Science: Chemistry: Organic chemistry: Biochemistry3
Medicine: Internal medicine: Neurosciences. Biological psychiatry. Neuropsychiatry3
Science: Chemistry2
Science: Physics2
Technology: Electrical engineering. Electronics. Nuclear engineering: Materials of engineering and construction. Mechanics of materials2
Science: Science (General): Cybernetics: Information theory2
Technology: Chemical technology: Biotechnology2
Technology: Chemical technology1
Science: Science (General)1
Technology: Mechanical engineering and machinery1
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics1
Science: Mathematics: Probabilities. Mathematical statistics1
Science: Biology (General): Genetics1
Medicine: Medicine (General)1
The category Science: Mathematics 11 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Homology Flows, Cohomology Cuts and was published in 2012. The most recent citation comes from a 2024 study titled Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants. This article reached its peak citation in 2023, with 6 citations. It has been cited in 28 different journals, 25% of which are open access. Among related journals, the Discrete & Computational Geometry cited this research the most, with 3 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year