Vol. 23 No. 3 (2018)

Regular articles

• Integrated Vehicle Scheduling and Vehicle Assignment

  József Békési, Balázs Dávid, Miklós Krész

  783-800

  • PDF

• Weighted Languages Recognizable by Weighted Tree Automata

  Zoltán Fülöp, Zsolt Gazdag

  867-886

  • PDF

• How Sufficient Conditions are Related for Topology-Preserving Reductions

  Kálmán Palágyi

  939-958

  • PDF

• The Metric Dimension of Two-Dimensional Extended Meshes

  Ron Adar, Leah Epstein

  761-772

  • PDF

• Approximations to the Normal Probability Distribution Function using Operators of Continuous-valued Logic

  József Dombi, Tamás Jónás

  829-852

  • PDF

• Spanning Tree Game as Prim Would Have Played

  András London, András Pluhár

  921-927

  • PDF

• ℓ 1 Regularization of Word Embeddings for Multi-Word Expression Identification

  Gábor Berend

  801-813

  • PDF

• DFS is Unsparsable and Lookahead Can Help in Maximal Matching

  Kitti Gelle, Szabolcs Iván

  887-902

  • PDF

• On Eigenvectors of the Pascal and Reed-Muller-Fourier Transforms

  Tamás Waldhauser

  959-979

  • PDF

• Regional Multicriteria and Multimodal Route Planning System for Public Transportation: A Case Study

  József Békési

  773-782

  • PDF

• The Convergence Time for Selfish Bin Packing

  György Dósa, Leah Epstein

  853-865

  • PDF

• On the Advice Complexity of Coloring Bipartite Graphs and Two-Colorable Hypergraphs

  Judit Nagy-György

  929-938

  • PDF

• In Memoriam Csanád Imreh

  János Csirik

  757-760

  • PDF

• Partition-Crossing Hypergraphs

  Csilla Bujtás, Zsolt Tuza

  815-828

  • PDF

• Analysis of Static and Dynamic Test-to-code Traceability Information

  Tamás Gergely, Gergő Balogh, Ferenc Horváth, Béla Vancsics, Árpád Beszédes, Tibor Gyimóthy

  903-919

  • PDF