Accepted papers


Regular papers

  1. József Békési, Gábor Galambos, András Kelemen, Imre Papp and József Tolnai
    A Neural Network Based Classification Algorithm for Asthma Using Capnography

  2. Andrej Brodnik, Bengt J. Nilsson and Gordana Vujovic
    Online Bin Covering with Exact Advice

  3. Munqath Al-Atar and Attila Sali
    Approximate Keys and Functional Dependencies in Incomplete Databases With Limited Domains--Algorithmic Perspective

  4. David Podgorelec, Luka Lukač and Borut Žalik
    Local reflection symmetry detection in Earth observation data

  5. Máté Hegyháti
    Systematic generation of precedence based MILP models with P-graphs for multipurpose scheduling problems

  6. Alain Quilliot
    Surrogate Component Approach for a Synchronization Problem

  7. Uroš Čibej and Ervin Győri
    Subsets without arithmetic subsequences: computational experiments and unsatisfiable cores

  8. Tomaž Dobravec
    Exact time measuring challenges

  9. Sandor Szabo and Bogdan Zavalnij
    Clique relaxations of zero-one linear programs

  10. Tamás Storcz, István Kistelegdy and Zsolt Ercsey
    Building energy demand regression

  11. Benedek Nagy
    On relations of Watson-Crick finite automata to other computational paradigms

Short papers

  1. Tamás Kis, András Kovács and Csaba Mészáros
    Robust bilevel programming with uncertain follower objectives

  2. András London
    Overlap of random spanning trees in complex networks

  3. Clément Dallard, Martin Milanič and Mirza Redžić
    Classes of graphs with tree-independence number at most two

  4. Mihály Gencsi and Boglárka G.-Tóth
    Simplification of the KKT optimality test in Interval Branch and Bound method

  5. Hasmik Sahakyan, Levon Aslanyan and Gyula Katona
    Notes on Identification of Monotone Boolean Functions with Machine Learning methods

  6. Gábor Kusper, Tibor Tajti and Imre Baják
    Implementing the Parallel CSFLOC SAT Solver using Dynamic Variable Reordering

  7. Gábor Kusper, Imre Baják and Benedek Nagy
    Using Extended Resolution to Represent Strongly Connected Components of Directed Graphs

  8. Zsuzsanna Nagy, Ágnes Werner-Stark and Tibor Dulai
    Solving Data-driven Dynamic Capacitated Arc Routing Problems

  9. Haifa Jammeli and Jerome Verny
    Intelligent system process for Home Delivery Problem in the city of Paris

  10. Bela Csaba, Andras London and Andras Pluhar
    Oriented discrepancy and anti-discrepancy in dense graphs

  11. Jurij Mihelič
    Experimental comparison of parallel implementations of DTW algorithms

  12. Tamás Vinkó
    New methods for maximizing the smallest eigenvalue of grounded Laplacian matrix

  13. Matjaž Depolli and Bogdan Zavalnij
    Eliminating vertex coloring in clique search

  14. András G. Hubai, Géza Meszéna and Beáta Oborny
    Mapping of transition rates between matrix population models and lattice models

  15. Péter Kardos and Farkas Richard
    Text and Graph Embeddings for the Knowledge Graph Matching task

  16. Pál Dömösi, Géza Horváth and Adama Diene
    The advantages of DH-Cipher

  17. Ervin Gyori
    The maximum number of short paths in planar and outerplanar graphs

  18. Peter L. Erdos and Tamás Róbert Mezei
    A fast clustering algorithm for Interference Minimization in Future Wireless Networks

  19. Janos Balogh, Gyorgy Dosa, Lars Magnus Hvattum, Tomas Attila Olaj and Zsolt Tuza
    Covering a square with consecutive squares

  20. Boštjan Slivnik and Uroš Čibej
    A new exact bound for the length of a 2-increasing sequence

  21. Eszter Julianna Gyulainé Csókás and Tamás Vinkó
    Approximations of influence diffusion inspired by exact models