Refereed Journal Articles

• Reduction of Smith Normal Form Transformation Matrices.
  Computing 74(4), p. 377-388, 2005.
  

• Constructions of Sparse Asymmetric Connectors with Number Theroretic Methods.
  Networks 45(3), p. 119-124, 2005.
  (with A. Baltz, and A. Srivastav)

• Improved Approximation Algorithms for Maximum Graph Partitioning Problems.
  Journal of Combinatorial Optimization 10(2), p. 133-167, 2005.
  (with A. Srivastav)

• Tolerances Applied in Combinatorial Optimization.
  Journal of Computer Science 2(9), p. 716-734, 2006.
  (with B. Goldengorin, and P. Molitor)

• Improving the Performance of Greedy Heuristics for TSPs Using Tolerances.
  Communications in Dependability and Quality Management 10(1), p. 52-70, 2007.
  (with D. Ghosh, B. Goldengorin, and G. Gutin)

• An Efficient Algorithm for Graph Bisection of Triangularizations.
  Applied Mathematial Sciences 25(1), p. 1203-1215, 2007.
  

• The Computational Efficiency of Ji-Lee-Li Algorithm for the Assignment Problem.
  Algorithmic Operations Research 3(1), p. 79-81, 2008.
  (with B. Goldengorin)

• How Frugal is Mother Nature with Haplotypes?
  Bioinformatics 25(1), p. 68-74, 2009.
  (with S. Climer, A.R. Templeton, and W. Zhang)

• The Number of Pessimistic Guesses in Generalized Mastermind.
  Information Processing Letters 109(12), p. 635-641, 2009.
  (with M. Peczarski)

• Efficient Parallelizations of Hermite and Smith Normal Form Algorithms.
  Parallel Computing 35(6), p. 345-357, 2009.
  (with C. Wagner)

• An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem.
  Journal of Artificial Intelligence Research 39, p. 663-687, 2010.
  (with W. Zhang)

• The Number of Pessimistic Guesses in Generalized Black-Peg Mastermind.
  Information Processing Letters 111(19), p. 933-940, 2011.
  (with M. Peczarski)

Refereed Conference Articles

• Parallel Algorithms for Computing the Smith Normal Form of Large Matrices.
  In J. Dongarra, D. Laforenza, and S. Orlando (Eds.),
  Proceedings of 10th European PVM/MPI 2003, volume 2840 of
  Lecture Notes in Computer Science, p. 170-179, Springer, Berlin-Heidelberg, 2003.
  

• Constructions of Sparse Asymmetric Connectors.
  In P.K. Pandya, and J. Radhakrishnan (Eds.),
  Proceedings of 23rd Conference on Foundations of Software Technology
  and Theoretical Computer Science (FSTTCS 2003), volume 2914 of
  Lecture Notes in Computer Science, p. 13-22, Springer, Berlin-Heidelberg, 2003.
  (with A. Baltz, and A. Srivastav)

• A New Algorithm for Computing the Smith Normal Form and its Implementation on Parallel Machines.
  Proceedings of 6th Workshop on Advances in Parallel and Distributed Computation Models,
  International Parallel and Distributed Processing Symposium (IPDPS 2004), IEEE CS Press (CD-ROM), 8 pages, 2004.
  

• Improved Approximation Algorithms for Maximum Graph Partitioning Problems.
  In P.K. Lodaya, and M. Mahajan (Eds.),
  
Proceedings of 24th Conference on Foundations of Software Technology
and Theoretical Computer Science (FSTTCS 2004), volume 3328 of
Lecture Notes in Computer Science, p. 348-359, Springer, Berlin-Heidelberg, 2004.
(with A. Srivastav)

• Some Basics on Tolerances.
  In S.-W. Cheng, and C.K. Poon (Eds.),
  
Proceedings of 2nd International Conference on Algorithmic Aspects in
Information and Management (AAIM 2006), volume 4041 of
Lecture Notes in Computer Science, p. 194-206, Springer, Berlin-Heidelberg, 2006.
(with B. Goldengorin, and P. Molitor)

• Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.
  In T. Erlebach (Ed.),
  
Proceedings of 3rd Workshop on Combinatorial and Algorithmic
Aspects of Networking (CAAN 2006), volume 4235 of
Lecture Notes in Computer Science, p. 86-97, Springer, Berlin-Heidelberg, 2006.
(with B. Goldengorin, and P. Molitor)

• Solving Generalized Maximum Dispersion with Linear Programming.
  In M.-Y. Kao, and X.-Y. Li (Eds.),
  
Proceedings of 3rd International Conference on Algorithmic Aspects in
Information and Management (AAIM 2007), volume 4508 of
Lecture Notes in Computer Science, p. 1-10, Springer, Berlin-Heidelberg, 2007.
(with A. Srivastav, and K. Wolf)

• Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP.
  In J. Janssen, and P. Pralat (Eds.),
  
Proceedings of 4th Workshop on Combinatorial and Algorithmic
Aspects of Networking (CAAN 2007), volume 4852 of
Lecture Notes in Computer Science, p. 99-111, Springer, Berlin-Heidelberg, 2007.
(with D. Richter, B. Goldengorin, and P. Molitor)

• Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order.
  In B. Yang, D.-Z. Du, and C.A. Wang (Eds.),
  
Proceedings of 2nd Annual International Conference on Combinatorial
Optimization and Applications (COCOA 2008), volume 5165 of
Lecture Notes in Computer Science, p. 211-224, Springer, Berlin-Heidelberg, 2008.
(with P. Molitor)

• Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges.
  In A. Goldberg, and Y. Zhou (Eds.),
  
Proceedings of 5th International Conference on Algorithmic Aspects in
Information and Management (AAIM 2009), volume 5564 of
Lecture Notes in Computer Science, p. 175-187, Springer, Berlin-Heidelberg, 2009.
(with C. Dong, D. Richter, and P. Molitor)

• Complete Parsimony Haplotype Inference Problem and Algorithms.
  In A. Fiat, and P. Sanders (Eds.),
  
Proceedings of 17th Annual European Symposium on
Algorithms (ESA 2009), volume 5757 of
Lecture Notes in Computer Science, p. 337-348, Springer, Berlin-Heidelberg, 2009.
(with S. Climer, and W. Zhang)

• A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem.
  In F. Ablayev, E.W. Mayr (Eds.),
  
Proceedings of 5th International Computer Science Symposium
in Russia (CSR 2010), volume 6072 of
Lecture Notes in Computer Science, p. 216-227, Springer, Berlin-Heidelberg, 2010.
(with W. Zhang)

• Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction.
  In B. Chen (Ed.),
  
Proceedings of 6th International Computer on Algorithmic Aspects in
Information and Management (AAIM 2010), volume 6124 of
Lecture Notes in Computer Science, p. 119-130, Springer, Berlin-Heidelberg, 2010.
(with C. Ernst, C. Dong, D. Richter, P. Molitor)

• The b-Matching Problem in Hypergraphs: Hardness and Approximability.
  In G. Lin (Ed.),
  
Proceedings of 6th Annual International Conference on Combintorial
Optimization and Applications (COCOA 2012), volume 7402 of
Lecture Notes in Computer Science, p. 200-211, Springer, Berlin-Heidelberg, 2012.
(with M. El Ouali)

Refereed Book Chapters

• Tolerance-based Algorithms for the Traveling Salesman Problem.
  In S.K. Neogy, R.B. Bapat, A.K. Das, and T. Parthasarathy (Eds.),
  
Mathematical Programming and Game Theory for Decision Making.
Chapter 5, p. 47-59. World Scientific, New Jersey, 2008.
(with D. Ghosh, B. Goldengorin, and G. Gutin)

Refereed Short Abstracts

• Constructions of Sparse Asymmetric Connectors.
  Proceedings of European Conference on Combinatorics,
  Graph theory and Applications (Eurocomb 2003), p. 37-41, 2003.
  (with A. Baltz, and A. Srivastav)

• Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones.
  In S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti (Eds.),
  
Proceedings of 8th Cologne-Twente Workshop on Graphs
and Combinatorial Optimization (CTW 2009). p. 3-6, 2009.
(with C. Dong, C. Ernst, D. Richter, and P. Molitor)

• An Effective SAT Encoding for Magic Labeling.
  In U. Faigle, R. Schrader, and D. Herrmann (Eds.),
  
Proceedings of 9th Cologne Twente Workshop on Graphs
and Combinatorial Optimization (CTW 2010). p. 97-100, 2010.

Refereed Technical Reports

• How to Make a Greedy Heuristic for the Asymmetric Traveling Salesman Problem Competitive.
  SOM (Systems, Organisations and Management) Research Report 05A11,
  University Groningen, The Netherlands, 16 pages, 2005.
  (with B. Goldengorin)

• Some Basics on Tolerances.
  SOM (Systems, Organisations and Management) Research Report 05A13,
  University Groningen, The Netherlands, 44 pages, 2005.
  (with P. Molitor, and B. Goldengorin)

Unpublished Articles

• An Explicit Construction of Sparse Asymmetric Connectors.
12 pages, 2003.
(with A. Baltz, A. Srivastav, and A. Ta-Shma)

• Model and Algorithms for Practical Tour Planning Based on the Traveling Salesman Problem with Multiple Time Windows.
15 pages, 2010.
(with A. Baltz, M. El Ouali, V. Sauerland and A. Srivastav)

A part of my publications can be found at the DBLP Bibliography Server.

Copyright notice