Optimalizációs módszerek a felhő számítástechnikában és kommunikációban  részletek

súgó  nyomtatás 
vissza »

 

Projekt adatai

 
azonosító
108947
típus K
Vezető kutató Recski András
magyar cím Optimalizációs módszerek a felhő számítástechnikában és kommunikációban
Angol cím Optimization Methods for Cloud Computing and Communications
magyar kulcsszavak felhő számítástechnika, távközlés, optimalizálás, gráfelmélet, algoritmusok
angol kulcsszavak cloud computing, telecommunication, optimization, graph theory, algorithms
megadott besorolás
Informatika (Élettelen Természettudományok Kollégiuma)40 %
Ortelius tudományág: Alkalmazott informatika
Automatizálás és Számítástechnika (Élettelen Természettudományok Kollégiuma)30 %
Ortelius tudományág: Automatizálás
Távközlés (Élettelen Természettudományok Kollégiuma)30 %
Ortelius tudományág: Távközlés
zsűri Informatikai–Villamosmérnöki
Kutatóhely Számítástudományi és Információelméleti Tanszék (Budapesti Műszaki és Gazdaságtudományi Egyetem)
résztvevők Babarczi Péter
Buza Krisztián Antal
Csehi Csongor György
Csizmadia Balázs
Friedl Katalin
Gulyás András
Gyimóthi László
Hosszú Éva
Kabódi László
Katona Gyula
Kiss Attila
Körösi Attila
Mann Zoltán Ádám
Pach Péter Pál
Pach Péter Pál
Papp László
Pašić Alija
Rétvári Gábor
Schlotter Ildikó
Soltész Dániel
Szabó Péter
Szeszlér Dávid
Tapolcai János
Tóth Ágnes
Vass Balázs
Wiener Gábor
projekt kezdete 2013-09-01
projekt vége 2018-08-31
aktuális összeg (MFt) 27.816
FTE (kutatóév egyenérték) 35.69
állapot aktív projekt





 

Zárójelentés

 
kutatási eredmények (magyarul)
Az információs technológiát alapjaiban reformálta meg a megjelenő felhő számítástechnika. A népszerű felhő alkalmazások terjedésének és a privát felhő hálózatok épülésének köszönhetően hatalmasra nőtt az adatközpontok számítási kapacitása. Az egyes számítógépek közötti összeköttetés garantálásán túl szükség van még: rövid kommunikációs utakra, tetszőleges két csomópont között több független útra, kiegyenlített terheltségre (ne legyenek túlterhelt linkek), hibatűrő és egyszerűen alakítható topológiára, kis kommunikációs költségre, könnyen üzemeltethető csomópontokra (állapotmentes címzés) és kis áramfelvételű megoldásokra. Célunk olyan topológiák és módszerek tervezése volt, amelyek ezeket mind figyelembe veszik. A kutatás során a problémákhoz kapcsolódó gráf struktúrákat, algoritmusokat, címzési és útvonal választási módszereket vizsgáltunk, a kombinatorikus és a hálózati kompetenciánk együttes alkalmazásával. A kutatás időtartama alatt 1 könyvet, 5 könyvfejezetet és 119 tudományos cikket publikáltunk (ezekből 85-öt nemzetközi tudományos folyóiratokban és 34-et nemzetközi konferenciák köteteiben)
kutatási eredmények (angolul)
Cloud computing has recently revolutionized information technology. Owing to the dynamic growth of popular public cloud applications and to the proliferation of private clouds, the computational capacity of the data centers has enormously increased. Besides scalable connectivity between the nodes, the profitable operation of a contemporary data center requires short paths, high path diversity (multiple edge-disjoint paths between the nodes), excellent load balancing algorithms, error resilience, low communication overhead, low cabling complexity, fast and easy node administration (addressing) and low power consumption. To meet these requirements, the interconnection structure of the servers and switches has to be carefully designed. In this respect the research for graph structures with the accompanying addressing and routing schemes providing many of these features at the same time is essential. For this purpose we combined our competences in discrete mathematics and in networking. During the project we published 1 book, 5 book chapters and 119 research papers (85 in international research journals and 34 in the proceedings of international conferences)
a zárójelentés teljes szövege https://www.otka-palyazat.hu/download.php?type=zarobeszamolo&projektid=108947
döntés eredménye
igen





 

Közleményjegyzék

 
Péter L. Erdős, Tamás Róbert Mezei, István Miklós, Dániel Soltész: Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs, PLoS One, accepted for publication, 2018
Katona Gyula Y; Soltész Dániel; Varga Kitti: Properties of minimally t-tough graphs, DISCRETE MATHEMATICS 341: (1) pp. 221-231., 2018
Katona Gyula Y: Extension of paths and cycles for hypergraphs, Electronic Notes in Discrete Mathematics 45: pp. 3-7., 2014
Tibor Jordán, Ildikó Schlotter: Parameterized complexity of Spare Capacity Allocation and the Multicost Steiner Subgraph problem, Journal of Discrete Algorithms 30, 29-44, 2015
Pach P P: Normal form for the words under Simon’s congruence, Semigroup Forum, to appear, https://doi.org/10.1007/s00233-017-9910-5, 2018
G. Wiener: On constructions of hypotraceable graphs, Electronic Notes in Discrete Mathematics, 54, 127-132., 2016
Gyula Y Katona, István Kovács, Kitti Varga: The complexity of recognizing minimally tough graphs,, The Electronic Journal of Combinatorics. submitted, 2017
Zoltán Ádám Mann:: Resource optimization across the cloud stack, IEEE Transactions on Parallel and Distributed Systems,29(1):169-182, 2018
Zoltán Ádám Mann: Two are better than one: An algorithm portfolio approach to cloud resource management, 6th European Conference on Service-Oriented and Cloud Computing, Springer LNCS vol. 10465, pp. 93-108, 2017
Katarína Cechlarová, Ildikó Schlotter: A connection between sports and matroids: How many teams can we beat?, Algorithmica, 80, 1, 258-278., 2018
G. Wiener: New constructions of hypohamiltonian and hypotraceable graphs, Journal of Graph Theory, 87, 526-535, 2018
Csongor Gy. Csehi, Adam Toth, Mark Farkas: A Self-Bounding Branch & Bound procedure for truck routing and scheduling, Informatica, submitted, 2018
A. Szenkovits, R. Meszlényi, K. Buza, N. Gaskó, R.I. Lung, M. Suciu: Feature Selection with a Genetic Algorithm for Classification of Brain Imaging Data, U. Stanczyk, B. Zielosko, L.C. Jain: Advances in Feature Selection for Data and Pattern Recognition, Springer, 2018
Péter G. N. Szabó: Characterization of Uniquely Representable Graphs, Discrete Applied Mathematics, submitted, 2018
Peter G. N. Szabó: Betweenness Structures of Small Linear Co-Size, Discrete Applied Mathematics, submitted, 2018
G. Wiener, C. Zamfirescu: Gallai's question and constructions of almost hypotraceable graphs, DISCRETE APPLIED MATHEMATICS 243, 270-278, 2018
G. Wiener: Depth first search in claw-free graphs, OPTIMIZATION LETTERS 12 pp. 367-373, 2018
G. Wiener: New constructions of hypohamiltonian and hypotraceable graphs, JOURNAL OF GRAPH THEORY 87 pp. 526-535, 2018
Szeszlér, D.: Hitting a Path: a Generalization of Weighted Connectivity via Game Theory, submitted, 2018
Ervin Győri; Gyula Y Katona; László F Papp; Casey Tompkins: The Optimal Pebbling Number of Staircase Graphs, Discrete Mathematics, accepted, 2018
Ervin Győri; Gyula Y Katona; László F Papp: Optimal pebbling and rubbling of graphs with given diameter, Discrete Applied Mathematics, 2018
Andrzej Czygrinow ; Glenn Hurlbert; Gyula Y. Katona; László. F. Papp: Optimal pebbling number of graphs with given minimum degree, Discrete Applied Mathematics, submitted, 2018
Zoltán Ádám Mann: Cloud simulators in the implementation and evaluation of virtual machine placement algorithms, Software: Practice and Experience, 48(7):1368-1389, 2018
Sevil Dräxler, Holger Karl, Zoltán Ádám Mann: JASPER: Joint optimization of scaling, placement, and routing of virtual network services, IEEE Transactions on Network and Service Management, accepted, 2018
Zoltán Ádám Mann: Optimization Problems in Fog and Edge Computing, Submitted, 2018
Imre Kocsis, Zoltán Ádám Mann, Dávid Zilahi: Optimised deployment of critical applications in Infrastructure-as-a-Service clouds, International Journal of Cloud Computing 6(4):342-362, 2017
Gergely Halácsy, Zoltán Ádám Mann: Optimal energy-efficient placement of virtual machines with divisible sizes., Information Processing Letters, volume 138, October 2018, pages 51-56, 2018
Zoltán Ádám Mann: Complexity of coloring random graphs: an experimental study of the hardest region, ACM Journal of Experimental Algorithmics, volume 23, issue 1, article 1.3, 2018
Katalin Friedl, László Kabódi: Storing the quantum Fourier operator in the QuIDD data structure, Acta Cybernetica 23 (2017) 503–512., 2017
Máté Csigi, Attila Kőrösi, József Bíró, Zalán Heszberger, Yury Malkov & András Gulyás: Geometric explanation of the rich-club phenomenon in complex networks, Nature Scientific Reports 7, Article number: 1730 (2017) doi:10.1038/s41598-017-01824-y, 2017
P. Babarczi, J. Tapolcai, A. Pašić, L. Rónyai, E. Bérczi-Kovács, and M. Médard: Diversity Coding in Two-Connected Networks, IEEE/ACM Transactions on Networking, vol. PP, iss. 99, pp. 1-12,, 2017
J. Tapolcai, L. Rónyai, B. Vass, and László Gyimóthi: List of Shared Risk Link Groups Representing Regional Failures with Limited Size,, in Proc. IEEE INFOCOM, Atlanta, USA, 2017
A. Pašić, P. Babarczi, and J. Tapolcai: Unambiguous Switching Link Group Failure Localization in All-Optical Networks, Wiley Networks, vol. PP, pp. 1-15,, 2017
B. Vass, E. Bérczi-Kovács, and J. Tapolcai: Enumerating Shared Risk Link Groups of Circular Disk Failures Hitting k nodes, in Proc. International Workshop on Design Of Reliable Communication Networks (DRCN), Munich, Germany, 2017
J. Yallouz, J. Tapolcai, A. Kőrösi, Kristof Berczi, L. Gyimóthi, and A. Orda: Packing Strictly-Shortest Paths in a Tree for QoS-Aware Routing,, in IFIP Networking Conference (Networking), Stockholm, Sweden, 2017
Attila Csoma, Attila Kőrösi, Gábor Rétvári, Zalán Heszberger, József Bíró, Mariann Slíz, Andrea Avena-Koenigsberger, Alessandra Griffa, Patric Hagmann and András Gulyás: Routes Obey Hierarchy in Complex Networks, Nature Scientific Reports 7, Article number: 7243 doi:10.1038/s41598-017-07412-4, 2017
J. Tapolcai, J. Biro, P. Babarczi, A. Gulyás, Z. Heszberger, D. Trossen: Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding, IEEE/ACM Transactions on Networking, 2015
Krisztian Buza, Gabor Nagy, Alexandros Nanopoulos: Storage-Optimizing Clustering Algorithms for High-Dimensional Tick Data, Expert Systems with Applications, 41 pp. 4148-4157., 2014
J. Tapolcai, Pin-Han Ho, P. Babarczi, L. Rónyai: Neighborhood Failure Localization in All-Optical Networks via Monitoring Trails, IEEE/ACM Transactions on Networking, 2015
Zoltán Ádám Mann, Anikó Szajkó: Average-case complexity of backtrack search for coloring sparse random graphs, Journal of Computer and System Sciences, volume 79, number 8, pages 1287-1301, 2013
Zoltán Ádám Mann, Pál András Papp: Predicting algorithmic complexity through structure analysis and compression, Applied Soft Computing, volume 13, number 8, pages 3582-3596, 2013
Zoltán Ádám Mann, Tamás Szép: Accelerating backtrack search with a best-first-search strategy, International Journal of Applied Mathematics and Computer Science, volume 24, number 4, pages 901-916, 2014
Zoltán Ádám Mann: Allocation of virtual machines in cloud data centers - a survey of problem models and optimization algorithms, ACM Computing Surveys, volume 48, issue 1, 2015
Zoltán Ádám Mann: Rigorous results on the effectiveness of some heuristics for the consolidation of virtual machines in a cloud data center, Future Generation Computer Systems, volume 51, pages 1-6, 2015
A. Gulyás, G. Rétvári, Z. Heszberger, R. Agarwal: On the Scalability of Routing with Policies, IEEE/ACM Transactions on Networking, 2014
M.L. Ali, Pin-Han Ho, J. Tapolcai, S. Subramaniam: Multi-Link Failure Localization via Monitoring Bursts, IEEE/OSA Journal of Optical Communications and Networking (JOCN), 2014
Csongor Gy. Csehi, András Recski: The graphicity of the union of graphic matroids, European Journal of Combinatorics, 2015
Bolla M, Bullins B, Chaturapruek S, Chen S, Friedl, K: Spectral properties of modularity matrices, Linear Algebra and its Applications 473: pp. 359-376, 2015
Zoltán Ádám Mann: A taxonomy for the virtual machine allocation problem, International Journal of Mathematical Models and Methods in Applied Sciences, volume 9, pages 269-276, 2015
Pach P P, Pinsker M, Pongrácz A, Szabó Cs: A new operation on partially ordered sets, Journal of Combinatorial Theory Series A 120:(7) 1450-1462, 2013
Pach P P: Generalized multiplicative Sidon sets, J. Number Theory 157, 507-529, 2015
A. Laszka, L. Buttyán, D. Szeszlér: Designing robust network topologies for wireless sensor networks in adversarial environments, Pervasive and Mobile Computing, Volume 9, Issue 4, pages 546-563., 2013
Ágnes Tóth: On the ultimate categorical independence ratio, Journal of Combinatorial Theory Series B 108, pp. 29-39, 2014
P. Babarczi, A. Pasic, J. Tapolcai, F. Németh, and B. Ladóczki: Instantaneous recovery of unicast connections in transport networks: routing versus coding, Computer Networks (Elsevier), Special Issue on Robust and Fault-tolerant Communication Networks, 2015
J. Tapolcai, Pin-Han Ho, P. Babarczi, L. Rónyai: Internet Optical Infrastructure - Issues on Monitoring and Failure Restoration, Springer, 2015
Nenad Tomasev, Krisztian Buza, Kristóf Marussy, Piroska B. Kis: Hubness-aware Classification, Instance Selection and Feature Construction: Survey and Extensions to Time-Series, In: U. Stańczyk, L. Jain (eds.), Feature selection for data and pattern recognition (tentative title), to be published by Springer-Verlag, 2015
Katona Gyula Y: Extension of paths and cycles for hypergraphs, Electronic Notes in Discrete Mathematics 45: pp. 3-7., 2014
Katona Gyula Y., Sieben N.: Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs, Graphs and Combinatorics 29: (3) pp. 535-551, 2013
Lázár Jani, Zoltán Ádám Mann: Cache optimization for CPU-GPU heterogeneous processors, American Journal of Algorithms and Computing, volume 2, number 1, pages 18-31, 2015
Pach P P: Ramsey type results on the solvability of certain equations in Z_m, Integers, 13, 2013
Pach P P, Pluhár G, Pongrácz A, Szabó Cs: The number of rooted trees of given depth, Electron. J. Comb. 20:(2) P38, 2013
Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Ildikó Schlotter: complexity of Eulerian deletion problems, Algorithmica, volume 68, issue 1, pp. 41-61, 2014
Tibor Jordán, Ildikó Schlotter: Parameterized complexity of Spare Capacity Allocation and the Multicost Steiner Subgraph problem, Journal of Discrete Algorithms 30, 29-44, 2015
Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth: A Note on Covering Edge Colored Hypergraphs by Monochromatic Components, Electronic Journal of Combinatorics 21:(2), P2.33, 10 p., 2014
P. Damaschke, A. S. Muhammad, G. Wiener: Strict Group Testing and the Set Basis Problem, Journal of Combinatorial Theory A, 2014
Friedl, K, Kabódi, L: An idea to improve QuIDD based quantum simulations, Periodica Polytechnica Electrical Engineering and Computer Science, 59(2), pp. 48-55, 2015
Katona Gyula Y., M. Faghani, A.R. Ashrafi: Centrosymmetric graph and a lower bound for graphs energy of fullerens, Discussiones Mathematicae Graph Theory, doi:10.7151/dmgt.1761, 2014
Csongor Gy. Csehi, András Recski: The graphicity of the union of graphic matroids, European Journal of Combinatorics 50 38-47, 2015
Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Ildikó Schlotter: Parametrized complexity of Eulerian deletion problems, Algorithmica, volume 68, issue 1, pp. 41-61, 2014
Katona Gyula Y., M. Faghani, A.R. Ashrafi: Centrosymmetric graph and a lower bound for graphs energy of fullerens, Discussiones Mathematicae Graph Theory, doi:10.7151/dmgt.1761, 2014
Croot E, Lev V F, Pach P P: Progression-free sets in Z_4^n are exponentially small, Ann. of Math. in print, 2016
Dávid Szeszlér: Security Games on Matroids, Mathematical Programming, 18 pp, 2016
Ervin Győri, Gyula Y. Katona, László F. Papp: Optimal pebbling of grids, 13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization. Isztambul, Törökország, pp. 156-162., 2015
Gyula Y Katona, László F. Papp: Upper Bound on the Optimal Pebbling Number in graphs with given minimum degree, Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications. Fukuoka, Japan, pp. 313-317., 2015
Gyula Y Katona, László F Papp: Optimal pebbling of grids, Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications. Fukuoka, Japan, pp. 307-311., 2015
Gyula Y Katona. László F. Papp: Upper Bound on the Optimal Rubbling Number in graphs with given minimum degree, Discrete Applied Mathematics 209 227--246., 2016
Pach P P: Normal form for the words under Simon’s congruence, Semigroup Forum, submitted, 2016
Pach P P, Sándor Cs: Multiplicative bases and an Erdős problem, Combinatorica, submitted, 2016
Gyula Y. Katona, Péter G.N. Szabó: Bounds on the Number of Edges in Hypertrees,, Discrete Mathematics, 339(7) 1884--1891, 2016
Zoltán Ádám Mann: Multicore-aware virtual machine placement in cloud data centers, IEEE Transactions on Computers, accepted, 2016
Zoltán Ádám Mann: A comment on "Process placement in multicore clusters: Algorithmic issues and practical techniques", IEEE Transactions on Parallel and Distributed Systems, volume 27, issue 8, pages 2475-2476, 2016
Alija Pašić, Péter Babarczi, and Attila Kőrösi: Diversity Coding-Based Survivable Routing with QoS and Differential Delay Bounds, Elsevier Optical Switching and Networking (OSN), Special Issue on Reliable Network Design and Modeling, pp. 1-11, 2016
Jose Yallouz, Ori Rottenstreich, Péter Babarczi, Avi Mendelson, and Ariel Orda: Optimal Link-Disjoint Node-"Somewhat Disjoint'' Paths,, 24th IEEE International Conference on Network Protocols (ICNP), pp. 1-10, accepted, 2016
Alija Pašić and Péter Babarczi: Switching Link Group Failure Localization via Monitoring Trails in All-Optical Networks, 8th Workshop on Reliable Networks Design and Modeling (RNDM), pp. 1-8, Halmstad, Sweden, accepted, 2016
Dávid Szabó, Attila Kőrösi, József Bíró and András Gulyás: A Deductive Way of Reasoning about the Internet AS Level Topology, Chinese Physics B 24:(11) Paper 118901., 2015
L. Molnár, G. Pongrácz, G. Enyedi, Z. L. Kis, L. Csikor, F. Juhász, A. Kőrösi, and G. Rétvári: Dataplane specialization for high performance OpenFlow software switching, ACM SIGCOMM, 2016
S. Nikolenko, K. Kogan, G. Rétvári, E. Bérczi-Kovács, and A. Shalimov: How to represent IPv6 forwarding tables on IPv4 or MPLS dataplanes, In Proc. 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS): GI 2016: 9th IEEE Global Internet Symposium, 2016
J. Tapolcai, L. Rónyai, É. Hosszu, L. Gyimóthi, P. Ho, and S. Subramaniam: Signaling Free Localization of Node Failures in All-Optical Networks, IEEE Transactions on Communications, vol. PP, iss. 99, pp. 1-1, 2016
] L Gyimóthi, J Tapolcai: A Heuristic Algorithm for Network-Wide Local Unambiguous Node Failure Localization, : Proc. International Conference on High Performance Switching and Routing (HPSR). Budapest 6 p, 2015
Gyimóthi László, Hosszu Éva, Tapolcai János: Constructions for Unambiguous Node Failure Localization in Grid Topologies, In: Jacek Rak, et al (szerk.) 7th Workshop on Reliable Networks Design and Modeling (RNDM). München. New York: IEEE, pp. 222-228. (ISBN:978-1-4673-8050-8), 2015
Gyula Y. Katona, Ph.D.; Dániel Soltész; Kitti Varga: Properties of minimally $t$-tough graphs, submitted to Discrete Mathematics, 2016
Faghani Morteza; Katona Gyula Y; Ashrafi Ali Reza; Koorepazan-Moftakhar Fatemeh: A Lower Bound for Graph Energy of Fullerenes, In: Ashrafi Reza Ali; Diudea V Mircea (szerk.) Distance, Symmetry, and Topology in Carbon Nanomaterials. Springer International Publishing, pp. 463-471., 2016
Győri Ervin; Katona Gyula Y; Lemons Nathan: Hypergraph extensions of the Erdős-Gallai Theorem, European J of Combinatorics (ISSN: 0195-6698) (eISSN: 1095-9971) 58, 2016
Bodó Ágnes; Katona Gyula Y; Simon Péter L: SIS Epidemic Propagation on Hypergraphs, Bulletin of Mathematical Biology 78: (4) pp. 713-7, 2016
Friedl K., Kabódi L.,: Storing the quantum Fourier operator in the QuIDD data structure,, in: Rudolf Ferenc, Balázs Bánhelyi, Tamás Gergely, Attila Kertész, Zoltán Kincses (szerk.) The 10th Jubilee Conference of PhD Students in Computer Science., 2016
Katarína Cechlárová, Eva Potpinková, Ildikó Schlotter: Refining the complexity of the sports elimination problem, Discrete Applied Mathematics, volume 199, pp. 172-186, 2016
Haris Aziz, Ildikó Schlotter, Toby Walsh: Control of Fair Division, Proceeding of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New York, 2016
G. Wiener: On constructions of hypotraceable graphs, Electronic Notes in Discrete Mathematics, to appear, 2016
G. Wiener: Depth first search in claw-free graphs, Proc. 19th JCDCGGG, Tokió, 2016
Dávid Bartók, Zoltán Ádám Mann: A branch-and-bound approach to virtual machine placement., Proceedings of the 3rd HPI Cloud Symposium "Operating the Cloud", pages 49-63., 2015
Zoltán Ádám Mann: The top 8 misconceptions about NP-hardness, IEEE Computer, accepted, 2016
Zoltán Ádám Mann: Interplay of virtual machine selection and virtual machine placement, 5th European Conference on Service-Oriented and Cloud Computing, accepted, 2016
Ehsan Ahvar, Shohreh Ahvar, Zoltán Ádám Mann, Noel Crespi, Joaquin Garcia-Alfaro, Roch Glitho: CACEV: a cost and carbon emission-efficient virtual machine placement method for green distributed clouds, 13th IEEE International Conference on Services Computing, accepted, 2016
Csehi, Cs. Gy. & Farkas, M.: Truck routing and scheduling,, Cent Eur J Oper Res, 2016
Csongor Gy. Csehi, Andras Recski: Matroid Union --- Graphic? Binary? Neither?, Discrete Applied Mathematics 209 75-83, 2016
Ervin Győri; Gyula Y Katona; László F Papp: Constructions for the optimal pebbling of grids, submitted to Periodica Polytechnica, 2016
Csongor Gy. Csehi, András Recski: The graphicity of the union of graphic matroids, European Journal of Combinatorics 50 38-47, 2015
Pach P P: Generalized multiplicative Sidon sets, J. Number Theory 157, 507-529, 2015
Katona Gyula Y: Extension of paths and cycles for hypergraphs, Electronic Notes in Discrete Mathematics 45: pp. 3-7., 2014
Katona Gyula Y., Sieben N.: Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs, Graphs and Combinatorics 29: (3) pp. 535-551, 2013
Croot E, Lev V F, Pach P P: Progression-free sets in Z_4^n are exponentially small, Ann. of Math. 185 (1) 331-337., 2017
Gyula Y Katona. László F. Papp: The optimal rubbling number of ladders, prisms and Möbius-ladders,, Discrete Applied Mathematics 209 227--246., 2016
Pach P P: Normal form for the words under Simon’s congruence, Semigroup Forum, submitted, 2016
Pach P P, Sándor Cs: Multiplicative bases and an Erdős problem, Combinatorica, submitted, 2016
Gyula Y. Katona, Péter G.N. Szabó: Bounds on the Number of Edges in Hypertrees,, Discrete Mathematics, 339(7) 1884--1891, 2016
Zoltán Ádám Mann: Multicore-aware virtual machine placement in cloud data centers, IEEE Transactions on Computers, volume 65, number 11, pages 3357-3369, 2016
Gyula Y. Katona, Ph.D.; Dániel Soltész; Kitti Varga: Properties of minimally $t$-tough graphs, Discrete Mathematics, accepted, 2016
G. Wiener: On constructions of hypotraceable graphs, Electronic Notes in Discrete Mathematics, 54, 127-132., 2016
G. Wiener: Depth first search in claw-free graphs, Proc. 19th JCDCGGG, Tokió, 2016
Zoltán Ádám Mann: The top 8 misconceptions about NP-hardness, IEEE Computer, volume 50, issue 5, pages 72-79,, 2016
Zoltán Ádám Mann: Interplay of virtual machine selection and virtual machine placement, 5th European Conference on Service-Oriented and Cloud Computing, Springer, 137-151, 2016
Ehsan Ahvar, Shohreh Ahvar, Zoltán Ádám Mann, Noel Crespi, Joaquin Garcia-Alfaro, Roch Glitho: CACEV: a cost and carbon emission-efficient virtual machine placement method for green distributed clouds, 13th IEEE International Conference on Services Computing, 275-282., 2016
Csongor Gy. Csehi, Andras Recski: Matroid Union --- Graphic? Binary? Neither?, Discrete Applied Mathematics 209 75-83, 2016
Csehi Csongor György, Recski András: Partitioning the bases of the union of matroids, DISCRETE MATHEMATICS 340:(4) pp. 691-694., 2017
Csehi Csongor György, Recski András: The importance of having feedback: An application of matroid union in network analysis, In: Frank András, Recski András, Wiener Gábor (szerk.) Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications. 117-124., 2017
Csehi Csongor György, Recski András: On the Graphicity of the Independence Structure of Linear Active Networks, PERIODICA POLYTECHNICA-ELECTRICAL ENGINEERING AND COMPUTER SCIENCE 61:(2) pp. 193-197., 2017
Ervin Győri; Gyula Y. Katona; László Papp: Constructions for the Optimal Pebbling of Grids, PERIODICA POLYTECHNICA-ELECTRICAL ENGINEERING AND COMPUTER SCIENCE 61: (2) pp. 217-223., 2017
G Y Katona; I Kovács; K Varga: The complexity of recognizing minimally tough graphs, In: Frank András; Recski András; Wiener Gábor Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications. 2017. pp. 329-334., 2017
E Győri; G Y Katona; L F Papp: Optimal pebbling and rubbling of graphs with given diameter, In: Frank András; Recski András; Wiener Gábor Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications. 2017. 189-196., 2017
Kitti Varga: Strengthening some complexity results on toughness of graphs, In: Frank András; Recski András; Wiener Gábor Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, pp. 503-510., 2017
Kovács István; Várady Tamás; Varga Kitti: A new set of base functions for parametric curve and surface design, in: Kiss Bálint; Szirmay-Kalos László Proceedings of the Workshop on the Advances of Information Technology: WAIT 2017. 2017. pp. 101-111., 2017
Ervin Győri; Gyula Y Katona; László F Papp; Casey Tompkins: The Optimal Pebbling Number of Staircase Graphs, Discrete Mathematics, submitted, 2017
Gyula Y Katona, István Kovács, Kitti Varga: The complexity of recognizing minimally tough graphs,, The Electronic Journal of Combinatorics. submitted, 2017
Ervin Gyori; Gyula Y Katona; László F Papp: Optimal pebbling and rubbling of graphs with given diameter,, Discrete Applied Mathematics, submitted, 2017
Zoltán Ádám Mann, Máté Szabó: Which is the best algorithm for virtual machine placement optimization?, Concurrency and Computation: Practice and Experience, volume 29, issue 10, DOI: 10.1002/cpe.4083,, 2017
Zoltán Ádám Mann, Pál András Papp: Guiding SAT solving by formula partitioning, International Journal on Artificial Intelligence Tools, volume 26, issue 4, article 1750011,, 2017
Zoltán Ádám Mann, Andreas Metzger: Optimized cloud deployment of multi-tenant software considering data protection concerns, Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017), pages 609-618, IEEE Press,, 2017
Sevil Dräxler, Holger Karl, Zoltán Ádám Mann: Joint optimization of scaling and placement of virtual network services, Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017), pages 365-370, IEEE Press, 2017
Zoltán Ádám Mann:: Resource optimization across the cloud stack, IEEE Transactions on Parallel and Distributed Systems, accepted, DOI: 10.1109/TPDS.2017.2744627., 2017
Zoltán Ádám Mann: Two are better than one: An algorithm portfolio approach to cloud resource management, 6th European Conference on Service-Oriented and Cloud Computing, accepted., 2017
Pach P P: Számtani sorozatot nem tartalmazó halmazok (in Hungarian),, Matematikai Lapok 22:(1) (2016) 1-7., 2016
Britta Dorn, Ildikó Schlotter: Having a Hard Time? Explore Parameterized Complexity!, In: Ulle Endriss (editor), Trends in Computational Social Choice, Chapter 11. AI Access, 2017
Ildikó Schlotter, Piotr Faliszewski, Edith Elkind: Campaign management under approval-driven voting, Algorithmica, volume 77, issue 1, pp. 84-115, 2017
Katarína Cechlarová, Ildikó Schlotter: A connection between sports and matroids: How many teams can we beat?, To appear in Algorithmica, doi.org/10.1007/s00453-016-0256-2., 2017
Matthias Mnich, Ildikó Schlotter: Stable marriage with covering constraints: A complete computational trichotomy, Accepted at SAGT 2017: the 10th International Symposium on Algorithmic Game Theory., 2017
Katarína Cechlárová, Tamás Fleiner, Ildikó Schlotter: Possible and necessary allocations under serial dictatorship with incomplete preference lists, Accepted at ADT 2017: the 5th International Conference on Algorithmic Decision Theory., 2017
Britta Dorn, Ronald de Haan, Ildikó Schlotter: Obtaining a proportional allocation by deleting items, Accepted at ADT 2017: the 5th International Conference on Algorithmic Decision Theory, 2017
István Kovács, Dániel Soltész: Triangle-different Hamiltonian paths,, J. Combintorial Theory Series B, accepted, 2017
P.G.N. Szabó: Three Theorems on the Combinatorics of Finite Metric Spaces, in: A. Frank, A. Recski, G. Wiener (Eds.): Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, pp. 469-472, 2017
Szeszlér, D.: Measuring Graph Robustness via Game Theory, , Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary (2017), 473-482., 2017
G. Wiener: New constructions of hypohamiltonian and hypotraceable graphs, Journal of Graph Theory, DOI 10.1002/jgt.22173, 2017
Csehi Csongor György, Recski András: Some new subclasses of graphic matroids, related to the union operation, In: Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications.Fukuoka, Japán, 2015.06.02-2015.06.05. pp. 83-90, 2015
Annamaria Szenkovits, Regina Meszlenyi, Krisztian Buza, Noemi Gasko, Rodica Ioana Lung, Mihai Suciu: Feature Selection with a Genetic Algorithm for Classification of Brain Imaging Data, in Urszula Stanczyk, Beata Zielosko, Lakhmi C. Jain (eds) Advances in Feature Selection for Data and Pattern Recognition, Springer, 2017
D. Gerbner, B. Keszegh, D. Pálvölgyi, G. Rote, G. Wiener:: Search for the end of a path in the d-dimensional grid and in other graphs, ARS MATHEMATICA CONTEMPORANEA 12:(2) pp. 301-314., 2017
G. Wiener: Leaf-critical and leaf-stable graphs, JOURNAL OF GRAPH THEORY, 84:(4) pp. 443-459., 2017
G. Wiener: Spanning trees with few leaves in claw-free graphs, , In: Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications pp. 511-516. (ISBN:978-963-313-253-1), 2017
Frank András, Recski András, Wiener Gábor (szerk.): Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, 518 p. (ISBN:978-963-313-253-1), 2017
D. Gerbner, B. Keszegh, D. Pálvölgyi, B. Patkós, M. Vizer, G. Wiener: Finding a non-minority ball with majority answers, DISCRETE APPLIED MATHEMATICS 219:(11) pp. 18-31., 2017





 

Projekt eseményei

 
2016-08-23 10:58:43
Résztvevők változása
2015-09-15 17:31:28
Résztvevők változása
2015-03-12 11:35:36
Résztvevők változása
2014-02-28 13:37:51
Résztvevők változása




vissza »