Authors Beginning With the Letter K

• Kabadi, S.

  • 2009 — Avec Chandrasekaran, R. et Nair, K., “2-Commodity Integer Network Synthesis Problem”

• Kabadi, S. N.

  • 2007 — Avec Du, D., “On-line Network Synthesis”
  • 2007 — Avec Baki, M. F., “Some Necessary Conditions and a General Sufficiency Condition for the Validity of A Gilmore-Gomory Type Patching Scheme for the Traveling Salesman Problem”

• Kabadi, Santosh

  • 2011 — Avec Punnen, Abraham, “Trioid:”

• Kalinowski, Thomas

  • 2009 — Avec Kiesel, Antje, “Approximated MLC shape matrix decomposition with interleaf collision constraint”
  • 2008 — “Reducing the tongue–and–groove underdosage in MLC shape matrix decomposition”

• Kameshwaran, S.

  • 2007 — Avec Benyoucef, Lyès et Xie, Xiaolan, “Branch-and-Cut Algorithms for Winner Determination in Discount Auctions”

• Kamiński, Marcin

  • 2007 — Avec Lozin, Vadim, “Vertex 3-colorability of claw-free graphs”

• Karapetyan, Daniel

  • 2012 — Avec Reihaneh, Mohammad, “An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem”
  • 2009 — Avec Gutin, Gregory, “Generalized Traveling Salesman Problem Reduction Algorithms”

• Kaul, Hemanshu

  • 2011 — Avec Sewell, E. et Jacobson, S., “Reductions for the Stable Set Problem”

• Kiesel, Antje

  • 2010 — Avec Engelbeen, Céline, “Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning”
  • 2009 — Avec Kalinowski, Thomas, “Approximated MLC shape matrix decomposition with interleaf collision constraint”

• Klasing, Ralf

  • 2009 — With Lotker, Zvi, Navarra, Alfredo, and Pérennes, Stéphane, “From Balls and Bins to Points and Vertices”
  • 2008 — Avec Gravier, Sylvain et Moncel, Julien, “Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs”
  • 2006 — With Laforest, Christian, Peters, Joseph, and Thibault, Nicolas, “Constructing Incremental Sequences in Graphs”

• Klau, Gunnar

  • 2008 — Avec Bauer, Markus et Reinert, Knut, “An Exact Mathematical Programming Approach to Multiple RNA Sequence-Structure Alignment”

• Kneis, Joachim

  • 2007 — With Böckenhauer, Hans-Joachim, Forlizzi, Luca, Hromkovič, Juraj, Kupke, Joachim, Proietti, Guido, and Widmayer, Peter, “On the Approximability of TSP on Local Modifications of Optimally Solved Instances”

• Koller, Angela

  • 2006 — Avec Gutin, Gregory et Yeo, Anders, “Note on Upper Bounds for TSP Domination Number”

• Kupke, Joachim

  • 2007 — With Böckenhauer, Hans-Joachim, Forlizzi, Luca, Hromkovič, Juraj, Kneis, Joachim, Proietti, Guido, and Widmayer, Peter, “On the Approximability of TSP on Local Modifications of Optimally Solved Instances”

• Kwon, Roy

  • 2011 — Avec Stoyan, Stephen, “Mean–Absolute Deviation Portfolio Models with Discrete Choice Constraints”