Algorithms and Discrete Applied Mathematics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

32

(FIVE YEARS 0)

H-INDEX

3

(FIVE YEARS 0)

Published By Springer International Publishing

9783319530062, 9783319530079

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Exact and Parameterized Algorithms for (k, i)-Coloring

Algorithms and Discrete Applied Mathematics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-53007-9_25 ◽

2017 ◽

pp. 281-293 ◽

Author(s):

Diptapriyo Majumdar ◽

Rian Neogi ◽

Venkatesh Raman ◽

Prafullkumar Tale

Keyword(s):

Parameterized Algorithms

Download Full-text

Subgraphs with Orthogonal $$[0,k_{i}]_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs

Algorithms and Discrete Applied Mathematics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-53007-9_32 ◽

2017 ◽

pp. 362-370

Author(s):

Sizhong Zhou ◽

Tao Zhang ◽

Zurun Xu

Download Full-text

Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two

Algorithms and Discrete Applied Mathematics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-53007-9_15 ◽

2017 ◽

pp. 166-176

Author(s):

Ajit A. Diwan ◽

Sai Sandeep

Keyword(s):

Directed Graphs ◽

Complete Multigraphs

Download Full-text

Finding Large Independent Sets in Line of Sight Networks

Algorithms and Discrete Applied Mathematics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-53007-9_29 ◽

2017 ◽

pp. 332-343 ◽

Author(s):

Pavan Sangha ◽

Michele Zito

Keyword(s):

Independent Sets ◽

Download Full-text

Structured Instances of Restricted Assignment with Two Processing Times

Algorithms and Discrete Applied Mathematics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-53007-9_21 ◽

2017 ◽

pp. 230-241

Author(s):

Klaus Jansen ◽

Lars Rohwedder

Keyword(s):

Processing Times ◽

Restricted Assignment

Download Full-text

Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System

Algorithms and Discrete Applied Mathematics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-53007-9_10 ◽

2017 ◽

pp. 107-117

Author(s):

Ante Ćustić ◽

Ehsan Iranmanesh ◽

Ramesh Krishnamurti

Keyword(s):

Winner Determination Problem ◽

Winner Determination

Download Full-text

Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime

Algorithms and Discrete Applied Mathematics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-53007-9_5 ◽

2017 ◽

pp. 50-59

Author(s):

Arindam Biswas ◽

Varunkumar Jayapaul ◽

Venkatesh Raman

Download Full-text

On Chromatic Number of Colored Mixed Graphs

Algorithms and Discrete Applied Mathematics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-53007-9_12 ◽

2017 ◽

pp. 130-140 ◽

Author(s):

Sandip Das ◽

Soumen Nandi ◽

Sagnik Sen

Keyword(s):

Chromatic Number ◽

Download Full-text

The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)

Algorithms and Discrete Applied Mathematics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-53007-9_26 ◽

2017 ◽

pp. 294-307

Author(s):

Abdullah Makkeh ◽

Mozhgan Pourmoradnasseri ◽

Dirk Oliver Theis

Download Full-text

Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams

Algorithms and Discrete Applied Mathematics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-53007-9_7 ◽

2017 ◽

pp. 72-82

Author(s):

Vladimir Braverman ◽

Harry Lang ◽

Keith Levin

Download Full-text