Accepted papers
printRegular papers
-
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 -
Andrej Brodnik, Bengt J. Nilsson and Gordana Vujovic
Online Bin Covering with Exact Advice -
Munqath Al-Atar and Attila Sali
Approximate Keys and Functional Dependencies in Incomplete Databases With Limited Domains--Algorithmic Perspective -
David Podgorelec, Luka Lukač and Borut Žalik
Local reflection symmetry detection in Earth observation data -
Máté Hegyháti
Systematic generation of precedence based MILP models with P-graphs for multipurpose scheduling problems -
Alain Quilliot
Surrogate Component Approach for a Synchronization Problem -
Uroš Čibej and Ervin Győri
Subsets without arithmetic subsequences: computational experiments and unsatisfiable cores -
Tomaž Dobravec
Exact time measuring challenges -
Sandor Szabo and Bogdan Zavalnij
Clique relaxations of zero-one linear programs -
Tamás Storcz, István Kistelegdy and Zsolt Ercsey
Building energy demand regression -
Benedek Nagy
On relations of Watson-Crick finite automata to other computational paradigms
Short papers
-
Tamás Kis, András Kovács and Csaba Mészáros
Robust bilevel programming with uncertain follower objectives -
András London
Overlap of random spanning trees in complex networks -
Clément Dallard, Martin Milanič and Mirza Redžić
Classes of graphs with tree-independence number at most two -
Mihály Gencsi and Boglárka G.-Tóth
Simplification of the KKT optimality test in Interval Branch and Bound method -
Hasmik Sahakyan, Levon Aslanyan and Gyula Katona
Notes on Identification of Monotone Boolean Functions with Machine Learning methods -
Gábor Kusper, Tibor Tajti and Imre Baják
Implementing the Parallel CSFLOC SAT Solver using Dynamic Variable Reordering -
Gábor Kusper, Imre Baják and Benedek Nagy
Using Extended Resolution to Represent Strongly Connected Components of Directed Graphs -
Zsuzsanna Nagy, Ágnes Werner-Stark and Tibor Dulai
Solving Data-driven Dynamic Capacitated Arc Routing Problems -
Haifa Jammeli and Jerome Verny
Intelligent system process for Home Delivery Problem in the city of Paris -
Bela Csaba, Andras London and Andras Pluhar
Oriented discrepancy and anti-discrepancy in dense graphs -
Jurij Mihelič
Experimental comparison of parallel implementations of DTW algorithms -
Tamás Vinkó
New methods for maximizing the smallest eigenvalue of grounded Laplacian matrix -
Matjaž Depolli and Bogdan Zavalnij
Eliminating vertex coloring in clique search -
András G. Hubai, Géza Meszéna and Beáta Oborny
Mapping of transition rates between matrix population models and lattice models -
Péter Kardos and Farkas Richard
Text and Graph Embeddings for the Knowledge Graph Matching task -
Pál Dömösi, Géza Horváth and Adama Diene
The advantages of DH-Cipher -
Ervin Gyori
The maximum number of short paths in planar and outerplanar graphs -
Peter L. Erdos and Tamás Róbert Mezei
A fast clustering algorithm for Interference Minimization in Future Wireless Networks -
Janos Balogh, Gyorgy Dosa, Lars Magnus Hvattum, Tomas Attila Olaj and Zsolt Tuza
Covering a square with consecutive squares -
Boštjan Slivnik and Uroš Čibej
A new exact bound for the length of a 2-increasing sequence -
Eszter Julianna Gyulainé Csókás and Tamás Vinkó
Approximations of influence diffusion inspired by exact models