Accepted papers

print

Regular Papers

  • Amar Bapić, Enes Pasalic and Samir Hodžić: On the notion of duals of certain AB functions
  • Uros Cibej and Jurij Mihelič: A polynomial-time algorithm for recognizing subgraph-symmetry-compressible graphs
  • Bela Csaba: A new graph decomposition method for bipartite graphs
  • Pál Dömösi, József Gáll, Géza Horváth and Norbert Tihanyi: Pseudorandom Number Generators Based on Compositions of Automata
  • Péter Egri, József Váncza, Ádám Szaller and Judit Monostori: Simulation Framework for Evaluating Production Networks
  • Zsolt Ercsey, Nándor Vincze and Zoltán Kovács: Process network solution of an extended multi-mode resource-constrained project scheduling problem with alternatives
  • Zsolt Gazdag: On the membership problem for some classes of random context grammars
  • Máté Hegyháti, Olivér Ősz and Tibor Holczinger: Empirical Study of S-graph Approaches for Limited-Wait Storage Policy
  • Aljaž Jeromel, Mitja Žalik, Matej Brumen and Niko Lukač: Visualization of 3D Earth using GIS services
  • András London and Imre Gera: Portfolio selection based on a configuration model and hierarchical clustering for asset graphs
  • Orsolya Kardos, András London and Tamás Vinkó: A simulator to study the stability of network centrality measures
  • Madeeha Fatima and Benedek Nagy: On the Combination of Finite State Transducers and Finite Automata with Translucent Letter
  • Martin Milanič, Nevena Pivač and Jernej Vičič: An ILP Formulation for the University Timetabling Problem at UP FAMNIT
  • Olivér Ősz and Máté Hegyháti: Energy usage minimization with the S-graph framework
  • David Podgorelec, Andrej Nerat and Borut Žalik: Statistics-based chain code compression with decreased sensitivity to shape artefacts
  • Julian Reisch, Peter Großmann and Natalia Kliewer: Conflict Resolving - A Maximum Independent Set Heuristics for Solving MaxSAT
  • Sandor Szabo and Bogdan Zavalnij: Combining algorithms for vertex cover and clique search
  • Sandor Szabo and Bogdan Zavalnij: Splitting partitions and clique search algorithms
  • Boglárka G.-Tóth: On a possible use of optimality conditions in interval Branch and Bound methods
  • Dino Vlahek, Tadej Stošić, Tamara Golob, Domen Mongus and Miloš Kalc: Method for estimating tensiomyography parameters from motion capture data
  • Dániel Zombori and Balázs Bánhelyi: ParallelGlobal with Low Thread Interactions

Short Papers

  • Eugenio Angriman, Alexander van der Grinten and Henning Meyerhenke: Scalable Algorithms for Group Centrality in Large Graphs
  • János Balogh, József Békési, György Dósa, Leah Epstein and Asaf Levin: A new and improved algorithm for online bin packing
  • Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanič and Mary Servatius: Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem
  • Csaba Beleznai and Daniel Steininger: Graph-based structure estimation and correlated motion tracking in queueing situations
  • Nina Chiarelli, Matjaž Krnc, Martin Milanič, Ulrich Pferschy, Nevena Pivač and Joachim Schauer: Fair division of indivisible goods with conflict constraints
  • Eszter Csókás and Tamas Vinko: On the solutions of an exact model for influence maximization
  • György Dósa, Hans Kellerer, Attila Tomas Olaj and Zsolt Tuza: Online scheduling with estimates on the total size
  • Ervin Gyori, Michael Plummer, Dong Ye and Xiaoya Zha: Cycle Traversability for Claw-free Graphs and Polyhedral Maps
  • László Hajdu and Miklós Krész: Sketch-Based Influence Maximization in Generalized Negative Model
  • Viktor Homolya and Tamas Vinko: Centrality measures and matrix factorization in weighted signed networks
  • Gabriel Istrate, Cosmin Bonchis and Claudiu Gatina: It's not whom you know, it' what you (or your friends !) can (help you) do: game-theoretic measures of helping centrality in social networks
  • Anna Elisabeth Kastner, Peter Greistorfer and Rostislav Staněk: Advanced facility location models for the placement of charging stations in e-mobility
  • András London and András Pluhár: Graph Clustering via Generalized Colorings
  • Csaba Meszaros: Interaction of hardware and implementation in large-scale optimization
  • Ulrich Pferschy, Joachim Schauer and Clemens Thielen: Complexity and Approximation of the Product Knapsack Problem
  • Attila Tóth: Graph model for machine configuration and workload balancing problem in multiple product PCB assembly