The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Abraham P. Punnen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
    Approximate local search in combinatorial optimization. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:587-596 [Conf]
  2. Abraham P. Punnen, François Margot, Santosh N. Kabadi
    TSP Heuristics: Domination Analysis and Complexity. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:2, pp:111-127 [Journal]
  3. Abraham P. Punnen
    A Fast Algorithm for a Class of Bottleneck Problems. [Citation Graph (0, 0)][DBLP]
    Computing, 1996, v:56, n:4, pp:397-401 [Journal]
  4. Abraham P. Punnen
    On bottleneck assignment problems under categorization. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2004, v:31, n:1, pp:151-154 [Journal]
  5. Abraham P. Punnen
    On combined minmax-minsum optimization. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1994, v:21, n:6, pp:707-716 [Journal]
  6. Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen
    A survey of very large-scale neighborhood search techniques. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:75-102 [Journal]
  7. Igor Averbakh, Oded Berman, Abraham P. Punnen
    Constrained Matroidal Bottleneck Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:63, n:3, pp:201-214 [Journal]
  8. Abraham P. Punnen, Yash P. Aneja
    Minimum Dispersion Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:75, n:1, pp:93-102 [Journal]
  9. Abraham P. Punnen, Santosh N. Kabadi
    Domination analysis of some heuristics for the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:119, n:1-2, pp:117-128 [Journal]
  10. Abraham P. Punnen, Kunhiraman Nair
    Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:55, n:1, pp:91-93 [Journal]
  11. Michael B. Richey, Abraham P. Punnen
    Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:39, n:2, pp:147-153 [Journal]
  12. Santosh N. Kabadi, Abraham P. Punnen
    Weighted graphs with all Hamiltonian cycles of the same length. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:129-139 [Journal]
  13. Jeffrey Mark Phillips, Abraham P. Punnen, Santosh N. Kabadi
    A Linear Time Algorithm for the Bottleneck Traveling Salesman Problem on a Halin Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:2, pp:105-110 [Journal]
  14. Abraham P. Punnen, Olena Chapovska
    The bottleneck k-MST. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:5, pp:512-517 [Journal]
  15. Abraham P. Punnen, Kunhiraman Nair
    A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:5, pp:283-286 [Journal]
  16. Abraham P. Punnen
    Minmax strongly connected subgraphs with node penalties. [Citation Graph (0, 0)][DBLP]
    JAMDS, 2005, v:9, n:2, pp:107-111 [Journal]
  17. Abraham P. Punnen, Prabha Sharma, Chin Diew Lai, Mahyar A. Amouzegar
    Preface. [Citation Graph (0, 0)][DBLP]
    JAMDS, 2005, v:9, n:2, pp:59-60 [Journal]
  18. Olena Chapovska, Abraham P. Punnen
    Variations of the prize-collecting Steiner tree problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:4, pp:199-205 [Journal]
  19. Abraham P. Punnen, Yash P. Aneja
    Lexicographic balanced optimization problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:1, pp:27-30 [Journal]
  20. James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
    Approximate Local Search in Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:5, pp:1201-1214 [Journal]
  21. Pooja Pandey, Abraham P. Punnen
    A simplex algorithm for piecewise-linear fractional programming problems. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:178, n:2, pp:343-358 [Journal]

  22. On the Approximability of the Vertex Cover and Related Problems. [Citation Graph (, )][DBLP]


  23. Integer Programming: Optimization and Evaluation Are Equivalent. [Citation Graph (, )][DBLP]


  24. Learning multicriteria fuzzy classification method PROAFTN from data. [Citation Graph (, )][DBLP]


  25. The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm. [Citation Graph (, )][DBLP]


  26. On the approximability of the vertex cover and related problems [Citation Graph (, )][DBLP]


  27. A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs [Citation Graph (, )][DBLP]


  28. Bottleneck flows in networks [Citation Graph (, )][DBLP]


  29. SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002