先进制造业知识服务平台
国家科技图书文献中心机械分馆　　工信部产业技术基础公共服务平台　　国家中小企业公共服务示范平台

会议文集


文集名WALCOM: Algorithms and Computation
会议名13th International Conference and Workshop on Algorithms and Computation (WALCOM 2019)
中译名《第十三届国际算法与计算会议》
机构Indian Institute of Technology
会议日期February 27 - March 2, 2019
会议地点Guwahati, India
出版年2019
馆藏号329510


题名作者出版年
Graph Profile Realizations and Applications to Social NetworksAmotz Bar-Noy; Keerti Choudhary; David Peleg; Dror Rawitz2019
Parameterized Computational Geometry via Decomposition TheoremsFahad Panolan; Saket Saurabh; Meirav Zehavi2019
r-Gatherings on a StarShareef Ahmed; Shin-ichi Nakano; Saidur Rahman2019
Topological Stability of Kinetic k-centersIvor Hoog v.d.; Marc van Kreveld; Wouter Meulemans; Kevin Verbeek; Jules Wulms2019
A Linear Time Algorithm for the r-Gathering Problem on the LineAnik Sarker; Wing-kin Sung; M. Sohel Rahman2019
Maximum-Width Empty Square and Rectangular AnnulusSang Won Bae; Arpita Baral; Priya Ranjan Sinha Mahapatra2019
Hard and Easy Instances of L-Tromino TilingsJavier T. Akagi; Carlos F. Gaona; Fabricio Mendoza; Manjil P. Saikia; Marcos Villagra2019
The Prefix Frechet SimilarityChristian Scheffer2019
Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path MetricsStefan Klootwijk; Bodo Manthey; Sander K. Visser2019
Optimal Partition of a Tree with Social DistanceMasahiro Okubo; Tesshu Hanaka; Hirotaka Ono2019
Flat-Foldability for 1 × n Maps with Square/Diagonal Grid PatternsYiyang Jia; Yoshihiro Kanamori; Jun Mitani2019
(k, p)-Planarity: A Relaxation of Hybrid PlanarityEmilio Di Giacomo; William J. Lenhart; Giuseppe Liotta; Timothy W. Randolph; Alessandra Tappini2019
Drawing Clustered Graphs on Disk ArrangementsTamara Mchedlidze; Marcel Radermacher; Ignaz Rutter; Nina Zimbel2019
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected ComponentsDuygu Vietz; Stefan Hoffmann; Egon Wanke2019
On the Algorithmic Complexity of Double Vertex-Edge Domination in GraphsY. B. Venkatakrishnan; H. Naresh Kumar2019
The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP SolverShuji Jimbo; Akira Maruoka2019
A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph DecompositionTakuya Tamori; Kei Kimura2019
Multilevel PlanarityLukas Barth; Guido Bruckner; Paul Jungeblut; Marcel Radermacher2019
Weighted Upper Edge Cover: Complexity and ApproximabilityKaveh Khoshkhah; Mehdi Khosravian Ghadikolaei; Jerome Monnot; Florian Sikora2019
Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack ProblemSoh Kumabe; Takanori Maehara; Ryoma Sin'ya2019
12



国家科技图书文献中心  全球文献资源网  京ICP备05055788号-26  机械工业信息研究院 2018-2024