Frontiers in Algorithmics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319784540, 9783319784557

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the Longest Spanning Tree with Neighborhoods

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78455-7_2 ◽

2018 ◽

pp. 15-28

Author(s):

Ke Chen ◽

Adrian Dumitrescu

Keyword(s):

Spanning Tree

Download Full-text

The Maximum Distance-d Independent Set Problem on Unit Disk Graphs

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78455-7_6 ◽

2018 ◽

pp. 68-80

Author(s):

Sangram K. Jena ◽

Ramesh K. Jallu ◽

Gautam K. Das ◽

Subhas C. Nandy

Keyword(s):

Unit Disk ◽

Independent Set ◽

Maximum Distance ◽

Independent Set Problem ◽

Unit Disk Graphs

Download Full-text

On Bayesian Epistemology of Myerson Auction

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78455-7_14 ◽

2018 ◽

pp. 183-196

Author(s):

Xiaotie Deng ◽

Keyu Zhu

Keyword(s):

Bayesian Epistemology

Download Full-text

Low-Weight Superimposed Codes and Their Applications

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78455-7_15 ◽

2018 ◽

pp. 197-211

Author(s):

Luisa Gargano ◽

Adele A. Rescigno ◽

Ugo Vaccaro

Keyword(s):

Superimposed Codes ◽

Low Weight

Download Full-text

Efficient Algorithms for a Graph Partitioning Problem

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78455-7_3 ◽

2018 ◽

pp. 29-42 ◽

Cited By ~ 2

Author(s):

S. Vaishali ◽

M. S. Atulya ◽

Nidhi Purohit

Keyword(s):

Graph Partitioning ◽

Efficient Algorithms ◽

Graph Partitioning Problem ◽

Partitioning Problem

Download Full-text

On the Minmax Regret Path Center Problem on Trees

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78455-7_4 ◽

2018 ◽

pp. 43-53

Author(s):

Biing-Feng Wang ◽

Jhih-Hong Ye ◽

Chih-Yu Li

Keyword(s):

Center Problem ◽

Minmax Regret

Download Full-text

Non-orthogonal Homothetic Range Partial-Sum Query on Integer Grids

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78455-7_21 ◽

2018 ◽

pp. 273-285

Author(s):

Yuan Tang ◽

Haibin Kan

Keyword(s):

Partial Sum

Download Full-text

Improved Kernels for Several Problems on Planar Graphs

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78455-7_13 ◽

2018 ◽

pp. 169-180

Author(s):

Qilong Feng ◽

Beilin Zhuo ◽

Guanlan Tan ◽

Neng Huang ◽

Jianxin Wang

Keyword(s):

Planar Graphs

Download Full-text

A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78455-7_5 ◽

2018 ◽

pp. 54-67

Author(s):

Koki Takayama ◽

Yusuke Kobayashi

Keyword(s):

Polynomial Time ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Supply Rate ◽

Strongly Polynomial Time ◽

Strongly Polynomial

Download Full-text

Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints

Frontiers in Algorithmics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-78455-7_23 ◽

2018 ◽

pp. 300-314

Author(s):

P. Wojciechowski ◽

K. Subramani ◽

Matthew Williamson

Keyword(s):

Optimal Length ◽

Utvpi Constraints ◽

Linear Feasibility

Download Full-text

Frontiers in Algorithmics - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

On the Longest Spanning Tree with Neighborhoods

The Maximum Distance-d Independent Set Problem on Unit Disk Graphs

On Bayesian Epistemology of Myerson Auction

Low-Weight Superimposed Codes and Their Applications

Efficient Algorithms for a Graph Partitioning Problem

On the Minmax Regret Path Center Problem on Trees

Non-orthogonal Homothetic Range Partial-Sum Query on Integer Grids

Improved Kernels for Several Problems on Planar Graphs

A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees

Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints

Frontiers in Algorithmics - Lecture Notes in Computer Science
Latest Publications