> abjbjrr .L\L\ZZZZZnnnntn!UTSSSSSSS$uW+Zz:SZ:SZZT666ZZS6S66KL`er0jtLST0!ULZf1Z,LLZZ0P0"6:S:S.4!UZ> :Period Closing Report
2013/09/01 2016/08/31
for the research project # 108947
Optimization Methods for Cloud Computing and Communications
The order of the presentation of the results follows that of the original research plan submitted in 2013. Results, reported in the Period Closing Reports 2013/09/01 2015/08/31 (available at the site HYPERLINK "http://cs.bme.hu/eng/period_closing_report_2015_sept_long_version.pdf" \t "_blank" http://cs.bme.hu/eng/period_closing_report_2015_sept_long_version.pdf) are not repeated here but the list of references of those documents are updated. The full list of the references of the present document contains 132 items, including 67 research articles (50 already published or accepted for publications and 17 submitted, under review), 1 book and 64 other items (book chapters, conference publications).
Part 1 (Scalable Data Center and Communication Architectures)
In [Babarczi 8] we further improved the previous research results on the all-optical failure localization framework, which enables a reliable transport infrastructure for future cloud services. In specific, we broke with the original concept of unambiguously localizing (single) link failures, and concentrated instead on the practically relevant problem of identifying the required switching actions at a particular node. First, based on the switching actions (known from the routing of the demands) we divided the identifiable links at a node into approximate and exact links. Next, using these sets we identified working path segments and allowed non-disruptive switching actions to form switching link groups, whose failure can be identified as a whole instead of its individual links. The benefit of this approach is twofold. On the one hand, from a theoretical point of view the first complexity result on single link failure localization with m-trails is provided, namely, the problem is intractable. On the other hand, from a practical viewpoint it enables a cheap implementation of a dynamic optical transport infrastructure, as it requires on average a wavelength per link and a single transponder per node less than the previous failure localization approaches.
In [Gulys 3] we have proposed a deductive approach for revealing network dynamics on the Internets AS level topology formation. We believe that this approach allows us to make some reasonable predictions about the structural changes of complex networks and facilitates the design of proactive algorithms. The first step for this is to find the correct premises, which is not trivial, but the findings of other complex networks can also be used as a starting point and even can reinforce each other. For example it is possible that valley-free information flow is not just an Internet specific feature. At the highest level it says: a minor node cannot serve the demand between two major nodes, which can also be used in neural or in social networks (after careful consideration, of course). So in accordance to this approach we made premises about the AS level Internet that have provided us the possibility of theoretical analysis and let us improve our interpretation of the AS system as provide insights complementary to the existing inductive models.
In [Tapolcai 7] we developed algorithms to allocate monitoring trails for localizing node failures in optical backbone networks. The approach follows the Network-wide local unambiguous failure localization (NL-UFL) concept. It attempts to enable every node to autonomously localize any failure event in the network in a distributed and all-optical manner by inspecting a set of m-trails traversing through the node. Bound analysis is performed using combinatorial group testing (CGT) theory and this is followed by the introduction of a novel heuristic on general topologies.
The paper [Gyimthi 1] deals with fast node failure localization in optical networks with monitoring trails (m-trails). It is based on network-wide local unambiguous failure localization, which enables every node to autonomously localize any single node failure in the network in a distributed and all-optical manner by inspecting the m-trails traversing through the node. A new and innovative heuristic algorithm is presented which is based on recursion and constrained matching algorithms in general graphs.The paper [Gyimthi 2] aims to provide optimal or near-optimal constructions for the monitoring trail problem in networks with grid topologies. We focus on the case of unambiguous single node failure localization both for the centralized and decentralized case.
Graph coloring, various graph parameters, related to routing and wavelength assignment (see also Part 4)
We say that two Hamiltonian paths are triangle different if their union contains a triangle. In [Soltsz 3] we determine exactly the maximal possible number of triangle-different Hamiltonian paths on any ground set. The problem is loosely related to Shannon capacity.
The Schrijver-graph is a well known color critical subgraph of the famous Kneser-graph. We investigate the maximal number of vertex disjoint Schrijver-subgraphs in the Kneser. In [Soltsz 4] we prove that for a very natural choice of parameters of these graphs, there is a threshold phenomenon and we give non-trivial bounds on the value of the threshold, but we do not determine it exactly.
Hamiltonicity and similar questions related to survival of link outages
All known hypotraceable graphs are constructed using hypohamiltonian graphs; in [Wiener 9] we present a construction that uses so-called almost hypohamiltonian graphs (nonhamiltonian graphs, whose vertex deleted subgraphs are hamiltonian with exactly one exception). The construction is an extension of a method of Thomassen. As an application, we construct a planar hypotraceable graph of order 138, improving the best known bound of 154. We also prove a structural type theorem showing that hypotraceable graphs possessing some connectivity properties are all built using either Thomassen's or our method.We also explore [Wiener 8] connections with a family of graphs introduced by Grnbaum in correspondence with the problem of finding graphs without concurrent longest paths.
In [Wiener 10] we prove that all claw-free graphs have a DFS-tree, such that the leaves different from the root have no common neighbour. This generalizes a theorem of Kano, Kyaw, Matsuda, Ozeki, Saito, and Yamashita and also implies a strengthening of a result of Ainouche, Broersma, and Veldman.
The paper [Varga 1] is related to an old conjecture: every minimally 1-tough graph contains a vertex of degree 1. The authors prove that the minimum degree in such graphs is not more than (n+2)/3.
Part 2 (Energy Efficient Backbone Infrastucture)
Previously, a cloud-ready implementation was made of the proposed network/diversity coding-based architecture. Later, we extended the model of finding a minimal cost reliable communication infrastructure for a communicating node pair with an additional additive constraint along the forwarding paths. This metric could reflect to e.g., the energy consumption of an optical lightpaths, but we were more interested in the total delay and delay difference of the (network coded) paths. These are the most widespread secondary metrics to ensure high quality of the communication paths and to provide high user experience for the cloud users. Thus, in [KQrsi 5] we introduced the Delay Aware Routing with Coding (DARC) problem, which captures several QoS routing and differential delay aware bounds of diversity coding-based survivable routing. Our work is built on the fact that the optimal solution of this routing problem has a well-defined structure, i.e., can be decomposed into three routing DAGs between the source and target node - proved in our previous work. We gave NP-completeness proofs for these problems, and demonstrated that although minimizing the total bandwidth cost of routing DAGs is polynomial time solvable, it leads to a hard problem when an additional delay bound is introduced on the routing DAGs. We discussed the approximability of both problems, while a heuristic approach was proposed to select paths with appropriate delay differences.
In [Mann 18] we have proven a conjecture about the optimal speedup of an algorithm to map parallel processes to the processor cores of a compute cluster.
In [Mann 19] we proposed a branch-and-bound algorithm for the virtual machine placement problem and showed empirically that it scales better than using an integer linear programming solver. In particular, the new algorithm yields good results in acceptable time for even thousands of virtual machines.
Previous work dealt with either the selection of virtual machines to accommodate computational tasks or the placement of virtual machines on the physical infrastructure. In [Mann 21] we have shown that it is beneficial to consider the two problems together.
In distributed clouds, geographically differing energy prices and availability of renewable energy make resource allocation an especially interesting problem. In [Mann 22] we extended our previous A*-based algorithm to deal with this more challenging optimization problem, taking into account the energy consumption of both server and network resources as well as their impact on costs and the environment.
Abstraction of paths, related to anycast routing
Katona with GyQri and Lemmons [Katona, 12] proved a hypergraph analogue of the well know ErdQs-Gallai theorem about the minimum number of edges in graph with no path of length more than k..
In 1999 Katona and Kierstead suggested to use chains in hypergraphs as the generalization of paths. In [Szab, 3] we generalized the concept of trees for uniform hypergraphs. An edge-minimal hypertree is a hypertree whose edge set is minimal with respect to inclusion. We showed that a k-uniform hypertree on n vertices has at least n - (k - 1) edges if n > n0(k), and it has at most n choose k-1 edges, which is an asymptotically sharp bound.
Related questions for structures, more general than graphs
If one of the matroids is an arbitrary graphic one and the other is the direct sum of loops and either a circuit or a cut set then the graphicity of their union has fully been characterized. As an application of this result the independence structure of some linear active networks has been studied and the existence of feedback has been proved to be the necessary and sufficient condition of the non-graphicity [Recski 2].
Part 3 (Scalable Data Center Applications)
In [KQrsi 6], we investigate how to design programmable packet forwarding elements, or switches, that support a large number of fundamentally different use cases, applications, and network functionality efficiently. This is of great importance in cloud networks, where the same switch device, depending on the configuration from the control plane, must be able to work either as a hypervisor switch, a cloud gateway, or a load balancer, or essentially any combination of these functions and others. Our idea is to let the switch automatically optimize its dataplane for the configured workload, by piecemeal compiling packet processing programs into custom fast paths. Our design results in orders of magnitudes better performance than existing switch designs from VMware or Cisco. The paper appeared at the most prominent venue for network research, ACM SIGCOMM'16, along with 38 other papers from major players in the community, like Google, Microsoft Research, MIT, Standford, and Princeton.
The paper [Rtvri 6] addresses the major question of how to adapt legacy network devices, with packet processing functionality and data structures embedded deeply into the very hardware, to the upcoming version of the Internet Protocol, IPv6. The problem is that IPv6, with its address space extended to 128 bits, maps very poorly to devices designed for the 32-bit IPv4. We propose an abstraction layer on top of the switches' existing IP or MPLS packet processing infrastructure, which allows a legacy device to forward IPv6 traffic very efficiently with zero modification to the hardware.
Pebbling and rubbling, related to complex job scheduling
Katona and Papp worked on questions of pebbling and rubbling numbers ofgraphs. Rubbling is an extension of pebbling, which is now a fairlyknown notion. They published a paper [Katona 10] that gives a formula for theoptimal rubbling number Ladders, Prisms and Mbius-ladders. They also improved an earlier upper bound by Czygrinow on the optimal pebblingnumber in graphs with given minimum degreeIn [Katona 13] Katona and Papp together with Ervin GyQri determined the optimalpebbling number of various stair-like graphs, and gave interesting upperand lower bounds of the optimal pebbling number of large grids.
Katona with coauthors wrote a survey [Katona, 11] about some graph theoretical methods in chemical mathematics. More precisely, on the lower bound for graph energy of fullerens.
Part 4 (Algorithms and Complexity in the Cloud)
In [Babarczi 9], we investigated the gap between the optimal node-disjoint and link-disjoint solutions for the problem of finding pairs of disjoint paths with a minimum sum of link weights. Specifically, we formalized several optimization problems that aim at finding minimum-weight link-disjoint paths while restricting the number of its common nodes to minimum, maximum and exactly k nodes, called the lower-bound, upper-bound and tight-bound problems, respectively. We established that the lower- and tight-bound problems are computationally intractable in general graphs, while for the upper-bound we established a polynomial-time algorithmic solution. Furthermore, we proved that all the three problem variants are polynomial-time solvable in directed acyclic graphs (DAGs). In the simulations we divided the network nodes into two sets: Type A nodes are expected to be common in the link-disjoint paths; and Type B nodes are regular network nodes. This classification evaluates a scenario of few beneficial (Type A) nodes, such as a data center or cloud nodes, at which most of the traffic crosses, while Type B represents a regular node, such as a client. The Type A nodes are connected with high-performance links, while the rest of the network (Type B) nodes linked with low-performance links between themselves and intermediate-performance links to Type A cloud nodes. The novel somewhat-disjoint path approach brought significant benefits on the weight of the paths compared to the node-disjoint solution.
Typical-case complexity of combinatorial optimization problems.
In computer engineering, NP-hard problems abound. Although the notion of NP-hardness enjoys increasing popularity among computer engineers, it is often used in a wrong way. The paper [Mann 20] highlights the most wide-spread misconceptions relating to reasons why a problem is NP-hard and its consequences.
Parameterized complexity:
[Schlotter 6] initiates the study of control actions in fair division problems where a benevolent or malicious central organizer changes the structure of the fair division problem for self-interest or to benefit one, some or all agents. One motivation for such control is to improve fairness by minimally changing the problem. As a case study, we consider the problem of adding or deleting a small number of items to improve fairness. For two agents, we present polynomial-time algorithms for adding or deleting the minimum number of items to achieve ordinal envy-freeness. For three agents, we show that both problems, as well as the more basic problem of checking whether an envy-free allocation exists, are NP-complete. This closes a problem open for over five years. Our framework leads to a number of interesting directions in the area of fair division.
Further algorithmic results:
Simulating quantum algorithms on a classical computer is a known hard problem. To help this matter special data structures are used. One of them is the QuIDD data structure, which stores the operators using a special reduced ordered decision diagram. In [Friedl 4] we examined the effect of changing the ordering of the variables in the Fourier operator. We investigated two different orderings, and found that they improve over the standard ordering, they need fewer nodes than the standard one.
Further combinatorial results
In [Pach 7] we show that any subset A of Z_4^n free of three-term arithmetic progressions has size |A| d" 4^(n) with an absolute constant H"0.926.Before this result the best bound was 4^n/n(log n)^eps, due to Sanders. We note that this exponential reduction is first of its kind for problems of this sort and there are already over 10 papers using the new technique that is presented in this paper.
Simon's congruence relates the words having the same subwordsof length at most k. In [Pach 8] a normal form is presented for the equivalence classes for every k.
In [Pach 9] we investigate how small the density of a multiplicative basis of order h can be in {1, 2, ..., n} and in N. Furthermore, a related problem of ErdQs is also studied: How dense can a set of integers be, if none of them divides the product of h others?
References
[Babarczi 1] J. Tapolcai, Pin-Han Ho, P. Babarczi, L. Rnyai, "Internet Optical Infrastructure - Issues on Monitoring and Failure Restoration", Springer, pp. 1-212, 2015. [ISBN 978-1-4614-7737-2]
[Babarczi 2] J. Tapolcai, J. Biro, P. Babarczi, A. Gulys, Z. Heszberger, D. Trossen, "Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding", IEEE/ACM Transactions on Networking, 23, 10, 2014. [impact factor 1.986]
[Babarczi 3] J. Tapolcai, Pin-Han Ho, P. Babarczi, L. Rnyai, "Neighborhood Failure Localization in All-Optical Networks via Monitoring Trails", IEEE/ACM Transactions on Networking, 1, 1-12, 2015. [impact factor 1.986]
[Babarczi 4] A. Pasic, J. Tapolcai, P. Babarczi, E. Brczi-Kovcs, Z. Kirly, and L. Rnyai, Survivable routing meets diversity coding, in IFIP Networking, Toulouse, France, 2015, pp. 1-9. acceptance rate 24%
[Babarczi 5] P. Babarczi, A. Pasic, J. Tapolcai, F. Nmeth, and B. Ladczki, Instantaneous recovery of unicast connections in transport networks: routing versus coding, Elsevier Computer Networks, Special Issue on Robust and Fault-tolerant Communication Networks, 2015. impact factor 1.282
[Babarczi 6] A. Pasic and P. Babarczi, Delay aware survivable routing with network coding in software defined networks, inProc. Reliable Networks Design and Modeling (RNDM), Munich, Germany, 2015, pp. 1-7.
[Babarczi 7] Tapolcai, P. Ho, P. Babarczi, and L. Rnyai, Neighborhood Failure Localization in All-Optical Networks via Monitoring Trails, in IEEE/ACM Transactions on Networking, vol. PP, iss. 99, pp. 1-1, 2015. accepted.
[Babarczi 8] Alija Paai and Pter Babarczi, Switching Link Group Failure Localization via Monitoring Trails in All-Optical Networks, accepted to the 8th Workshop on Reliable Networks Design and Modeling (RNDM), pp. 1-8, Halmstad, Sweden, 2016.
[Babarczi 9] Jose Yallouz, Ori Rottenstreich, Pter Babarczi, Avi Mendelson, and Ariel Orda, Optimal Link-Disjoint Node-``Somewhat Disjoint'' Paths, accepted to the 24th IEEE International Conference on Network Protocols (ICNP), pp. 1-10, Singapore, 2016.
[Buza 1] Krisztian Buza, Gabor Nagy, Alexandros Nanopoulos: Storage-Optimizing Clustering Algorithms for High-Dimensional Tick Data, Expert Systems with Applications, 41 pp. 4148-4157. (2014), impact factor: 1.854[Buza 2] Nenad Tomasev, Krisztian Buza, Kristf Marussy, Piroska B. Kis: Hubness-aware Classification, Instance Selection and Feature Construction: Survey and Extensions to Time-Series, In: U. StaDczyk, L. Jain (eds.), Feature selection for data and pattern recognition (tentative title), to be published by Springer-Verlag, book chapter, 28 pages
[Buza 3] Krisztian Buza, Gabor I. Nagy, Alexandros Nanopoulos: Trend analysis and anomaly detection in time series of language usage, VI. Dubrovnik Conference on Cognitive Science (DUCOG), 2014, conference abstract and poster
[Buza 4] Krisztian Buza, Gabor I. Nagy, Alexandros Nanopoulos: Three Open Questions related to the Tick Data Decomposition Problem, Summit240 Conference, 2014 conference abstract
[Bza 5] K. Buza (2015): Hubness: An Interesting Property of Nearest Neighbor Graphs and its Impact on Classification, 9th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Fukuoka, 2015, pp. 1-8.
[Bza 6] K. Marussy, L. Peka, K. Buza (2015): Recommendations of Unique Items Based on Bipartite Graphs, 9th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Fukuoka, 2015, pp. 439-448.
[Csehi 1] Csongor Gy. Csehi, Andrs Recski: The graphicity of the union of graphic matroids, European Journal of Combinatorics 50 (2015) 38-47.
[Csehi 2] Csongor Gy. Csehi, Andrs Recski: Matroid Union Graphic? Binary? Neither? 9th International colloquium on graph theory and combinatorics, 2014, Grenoble, Franciaorszg
[Csehi 3] Csongor Gy. Csehi, Andrs Recski: Some new subclasses of graphic matroids, related to the union operation, 9th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Fukuoka, 2015, pp. 83-90.
[Csehi 4] Csongor Gy. Csehi, Andrs Recski: Matroid Union Graphic? Binary? Neither?
Discrete Applied Mathematics 209 (2016) 75-83.
[Csehi 5] Csehi, Cs. Gy. & Farkas, M., Truck routing and scheduling,Cent Eur J Oper Res (2016). doi:10.1007/s10100-016-0453-8
[Friedl 1] 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)
[Friedl 2] Friedl, K, Kabdi, L: An idea to improve QuIDD based quantum simulations, Proc. of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and its Applications, Fukuoka, Japan, pp. 360-368, 2015.
[Friedl 3] Friedl, K, Kabdi, L: An idea to improve QuIDD based quantum simulations, Periodica Polytechnica Electrical Engineering and Computer Science, 59(2), pp. 48-55. (2015)
[Friedl 4] Friedl K., Kabdi L., Storing the quantum Fourier operator in the QuIDD data structure, in: Rudolf Ferenc, Balzs Bnhelyi, Tams Gergely, Attila Kertsz, Zoltn Kincses (szerk.) The 10th Jubilee Conference of PhD Students in Computer Science.
[Gulys 1] A. Csoma, B. Sonkoly, L. Csikor, F. Nmeth, A. Gulys, W. Tavernier and S. Sahhaf, "ESCAPE: Extensible Service ChAin Prototyping Environment using Mininet, Click, NETCONF and POX", In Proc. ACM SIGCOMM Demo, Chicago, IL, USA, August 17-22, 2014. ACM Press, 125-126.
[Gulys 2] B. Sonkoly, F. Nmeth, L. Csikor, L. Gulys, A. Gulys, "SDN based Testbeds for Evaluating and Promoting Multipath TCP", IEEE ICC 2014 Sydney Australia, pp. 3044-3050.
[Gulys 3] Dvid Szab, Attila KQrsi, Jzsef Br and Andrs Gulys, A Deductive Way of Reasoning about the Internet AS Level Topology, Chinese Physics B 24:(11) Paper 118901. (2015)
[Gyimthi 1] L Gyimthi, J Tapolcai, A Heuristic Algorithm for Network-Wide Local Unambiguous Node Failure Localization In: Proc. International Conference on High Performance Switching and Routing (HPSR). Budapest, 2015. 6 p.[Gyimthi 2] Gyimthi Lszl, Hosszu va, Tapolcai Jnos, Constructions for Unambiguous Node Failure Localization in Grid Topologies In: Jacek Rak, et al (szerk.) 7th Workshop on Reliable Networks Design and Modeling (RNDM). Mnchen, 2015. New York: IEEE, 2015. pp. 222-228. (ISBN:978-1-4673-8050-8)
[Katona 1] Katona Gyula Y., Paths and cycles in hypergraphs, Graph Theory Conferencein honor of Yoshimi Egawa on the occasion of his 60th birthday, 2014, Tokyo, Japan[Katona 2] Katona Gyula Y, Papp Lszl; The Optimal Rubbling Number of Ladders, Prisms and Mbius-ladders, 9th International colloquium on graph theory and combinatorics, 2014, Grenoble, Franciaorszg
[Katona 3] Katona Gyula Y, Extension of paths and cycles for hypergraphs, Electronic Notes in Discrete Mathematics 45: pp. 3-7. (2014)
[Katona 4] Katona Gyula Y., Sieben N., Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs, Graphs and Combinatorics 29: (3) pp. 535-551. (2013)[Katona 5] Katona Gyula Y., M. Faghani, A. R. Ashrafi, Centrosymmetric graph and a lower bound for graphs energy of fullerens, Discussiones Mathematicae Graph Theory, 2014 doi:10.7151/dmgt.1761
[Katona 6] . Bod, G. Y. Katona, P. L. Simon, SIS epidemic propagation on hypergraphs, Bulletin of Mathematical Biology 78: (4) pp. 713-735. (2016)
[Katona 7] E. GyQri;G. Y. Katona; L. F. Papp, Optimal pebbling of grids, In: 13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization. Isztambul, Trkorszg, 2015.05.26-2015.05.28. pp. 156-162.
[Katona 8] G. Y Katona; L F. Papp; Upper Bound on the Optimal Rubbling Number in graphs with given minimum degree, In: Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications. Fukuoka, Japn, 2015. pp. 313-317.
[Katona 9] G. Y Katona; L. F Papp; Optimal pebbling of grids, In: Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications. Fukuoka, Japn, 2015. pp. 307-311.
[Katona 10] G. Y Katona; L. F. Papp; Upper Bound on the Optimal Rubbling Number in graphs with given minimum degree, submitted to Discrete Applied Mathematics
[Katona 11] 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, 2016. pp. 463-471.
[Katona 12] GyQri Ervin; Katona Gyula Y; Lemons Nathan, Hypergraph extensions of the ErdQs-Gallai Theorem EUROPEAN JOURNAL OF COMBINATORICS (ISSN: 0195-6698) (eISSN: 1095-9971) 58: pp. 238-246. (2016)
[Katona 13] Ervin GyQri; Gyula Y Katona; Lszl F Papp;Constructions for the optimal pebbling of grids, submitted to Periodica Polytechnica
[Kiss 1] Attila Kiss: "3-Dimensional Gamma Routing Problem in VLSI Design", under review.
[Kiss 2] Attila Kiss, Andrs Recski: "Polynomial Time Algorithms for the 3-Dimensional VLSI Routing in the Cube", Summit 240 Conference, Budapest, Hungary, 2014.07.07-11.
[Kiss 3] Attila Kiss, Andrs Recski: "Universal Spacings for the 3-Dimensional VLSI Routing in the Cube", IX. International Colloquium on Graph Theory and Combinatorics, Grenoble, France, 2014.06.30-07.04.
[Kiss 4] Attila Kiss: "Space Decreasing Techniques for 3D VLSI Routing", Seventh Cracow Conference On Graph Theory, Rytro, Poland, 2014
[Kiss 5] Lszl Havasi, Attila Kiss, Lszl Sprs, Tams Szirnyi: "Online Multimodal Sensor Fusion with Fault Tolerance", under review, 2014
[Kiss 6] Attila Kiss, Anna Mndli, Tams Szirnyi: "Unsupervised Error Estimation of Autonomous Agent Networks", Seventh Cracow Conference On Graph Theory, Rytro, Poland, 2014
[Kiss 7] Lszl Havasi, Attila Kiss, Lszl Sprs, Tams Szirnyi: "Sensor Auto-Registration and Real-Time Fusion with Blob Alignment for Multimodal Image Sources", under review, 2014
[Kiss 8] Lszl Havasi, Attila Kiss, Lszl Sprs, Tams Szirnyi: "Calibrationless Sensor Fusion Using Linear Optimization for depth Matching", Combinatorial Image Analysis, Springer International Publishing, 2014. 158-170.
[Kiss 9] Attila Kiss, Andrs Recski: A spacing-volume tradeoff in 3-dimensional VLSI routing. Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications. Fukuoka, Japn, 2015. pp. 285-290.
[KQrsi 1] A. KQrsi, J. Tapolcai, Bence Mihlka, Gbor Mszros, G. Rtvri, "Compressing IP Forwarding Tables: Realizing Information-theoretical Space Bounds and Fast Lookups Simultaneously", In Proc. IEEE ICNP, 2014. pp. 332-343. [acceptance rate 20%].
[KQrsi 2] B. Mihlka, G. Rtvri, A. KQrsi, "Compressing Virtual Forwarding Information Bases Using Trie-folding Algorithm", IFIP EUNICE, Rennes, France, 2014. Springer Lecture Notes in Computer Science; 8846, pp. 121-133.
[KQrsi 3] M. Zubor, A. KQrsi, A. Gulys, G. Rtvri, "On the Computational Complexity of Policy Routing", IFIP EUNICE, Rennes, France, 2014. Springer Lecture Notes in Computer Science; 8846, pp. 202-214.
[KQrsi 4] G. Rtvri, D. Szab, A. Gulys, A. KQrsi, and J. Tapolcai, An information-theoretic approach to routing scalability, inProceedings of the 13th ACM Workshop on Hot Topics in Networks (HotNETS), 2014, p. 2
[KQrsi 5] Alija Paai, Pter Babarczi, and Attila KQrsi, 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, impact factor 1.137 (in 2015), 2016.
[KQrsi 6] L. Molnr, G. Pongrcz, G. Enyedi, Z. L. Kis, L. Csikor, F. Juhsz, A. KQrsi, and G. Rtvri. Dataplane specialization for high performance OpenFlow software switching. In ACM SIGCOMM, 2016.
[Mann 1] Zoltn dm 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, Elsevier, 2013. IF=1.091.
[Mann, 2] Zoltn dm Mann, Pl Andrs Papp: Predicting algorithmic complexity through structure analysis and compression. Applied Soft Computing, volume 13, number 8, pages 3582-3596, Elsevier, 2013. IF=2.679.
[Mann 3] Zoltn dm Mann: Typical-case complexity and the SAT competitions. Proceedings of the 5th Pragmatics of SAT Workshop (POS-14), EasyChair Proceedings in Computing, volume 27, pages 72-87, 2014
[Mann 4] Zoltn dm Mann, Pl Andrs Papp: Formula partitioning revisited. Proceedings of the 5th Pragmatics of SAT Workshop (POS-14), EasyChair Proceedings in Computing, volume 27, pages 41-56, 2014
[Mann 5] Zoltn dm Mann, Tams Szp: 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. IF=1.39
[Mann 6] Dvid Bartk, Zoltn dm Mann: Accelerating SAT solving with best-first-search. Proceedings of the 15th IEEE International Symposium on Computational Intelligence and Informatics, pages 43-48, 2014.
[Mann 7] Zoltn dm 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. IF=3.373
[Mann 8] Zoltn dm 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. IF=2.786
[Mann 9] Imre Kocsis, Zoltn dm Mann, Dvid Zilahi: Optimal deployment for critical applications in Infrastructure as a Service. 3rd International IBM Cloud Academy Conference (ICACON 2015), 2015.
[Mann 10] Ehsan Ahvar, Shohreh Ahvar, Noel Crespi, Joaquin Garcia-Alfaro, Zoltn dm Mann: NACER: a Network-Aware Cost-Efficient Resource allocation method for processing-intensive tasks in distributed clouds. Accepted for the 14th IEEE International Symposium on Network Computing and Applications, 2015.
[Mann 11] Imre Kocsis, Zoltn dm Mann, Dvid Zilahi: Optimal deployment for critical applications in Infrastructure as a Service. Submitted for peer review.
[Mann 12] Zoltn dm Mann: Multicore virtual machine placement in cloud data centers. Submitted for peer review
[Mann 13] Zoltn dm Mann: Modeling the virtual machine allocation problem. Proceedings of the International Conference on Mathematical Methods, Mathematical Models and Simulation in Science and Engineering, pages 102-106, 2015.
[Mann 14] Zoltn dm Mann: Approximability of virtual machine allocation: much harder than bin packing. Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, pages 21-30, 2015.
[Mann 15] Lzr Jani, Zoltn dm Mann: Cache optimization for CPU-GPU heterogeneous processors. American Journal of Algorithms and Computing, volume 2, number 1, pages 18-31, 2015.
[Mann 16] Zoltn dm 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.
[Mann 17] Zoltn dm Mann: Complexity of coloring random graphs: zooming in on the hardest part. Submitted for peer review.
[Mann 18] Zoltn dm 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.
[Mann 19] Dvid Bartk, Zoltn dm Mann: A branch-and-bound approach to virtual machine placement. Proceedings of the 3rd HPI Cloud Symposium "Operating the Cloud", pages 49-63, 2015.
[Mann 20] Zoltn dm Mann: The top 8 misconceptions about NP-hardness. IEEE Computer, accepted.
[Mann 21] Zoltn dm Mann: Interplay of virtual machine selection and virtual machine placement. 5th European Conference on Service-Oriented and Cloud Computing, accepted, 2016.
[Mann 22] Ehsan Ahvar, Shohreh Ahvar, Zoltn dm 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.
[Pach 1] Pach P P:Ramsey type results on the solvability of certain equations in Z_m, Integers, 13, 2013
[Pach 2] Pach P P, Pinsker M, Pongrcz A, Szab Cs:A new operation on partially ordered sets, Journal of Combinatorial Theory Series A Structure Design and Applications 120:(7) 1450-1462., 2013
[Pach 3] Pach P P, Pluhr G, Pongrcz A, Szab Cs:The number of rooted trees of given depth, Electron. J. Comb. 20:(2) P38, 2013
[Pach 4] Pach P P:Generalized multiplicative Sidon sets, J. Number Theory 157 (2015), 507-529.
[Pach 5] Pach P P:Generalized multiplicative Sidon-sequences, 9th International Colloquium on Graph Theory and Combinatorics, Grenoble, 2014 (abstract)
[Pach 6] Pach P P:Solving Equations under Simons Congruence, Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (2015), 201-206.
[Pach 7] Croot E, Lev V F, Pach P P: Progression-free sets in Z_4^n are exponentially small, Ann. of Math.
[Pach 8] Pach P P:Normal form for the words under Simons congruence, submitted (2016)
[Pach 9] Pach P P, Sndor Cs: Multiplicative bases and an ErdQs problem, submitted (2016)
[Recski 1] Andrs Recski, Matroid duality and voltage-current symmetries, Proc. 8th Japanese-Hungarian Symposium on Discrete Mathematics and its Applications, 2013, 419-425.
[Recski 2] Csongor Gy. Csehi, Andrs Recski: On the graphicity of the independence structure of linear active networks, Periodica Polytechnica (El. Eng. Comp. Sci.) submitted
[Rtvri 1] M. Nagy, J. Tapolcai, G. Retvari, "On the Design of Resilient IP Overlays", In Proc. International Workshop on Design Of Reliable Communication Networks (DRCN), Ghent, Belgium, 2014, pp. 1-8.
[Rtvri 2] A. Gulys, G. Rtvri, Z. Heszberger, R. Agarwal, "On the Scalability of Routing with Policies", IEEE/ACM Transactions on Networking, 23, 9, 2014. [impact factor 1.986]
[Rtvri 3] A. Majdn, G. Rtvri, J. Tapolcai, "Development and Performance Evaluation of Fast Combinatorial Unranking Implementations", IFIP EUNICE, Rennes, France, 2014, Lecture Notes in Computer Science Vol. 8846, 97-108.
[Rtvri 4] J. Tapolcai, G. Rtvri, P. Babarczi, E. Brczi-Kovcs, P. Kristf, and G. Enyedi, Scalable and efficient multipath routing: complexity and algorithms, in IEEE International Conference on Network Protocols (ICNP), San Francisco, CA, USA, 2015, pp. 1-10, acceptance rate 18%.
[Rtvri 5] S. Nikolenko, K. Kogan, G. Rtvri, E. Brczi-Kovcs, 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.
[Schlotter 1] Marek Cygan, Dniel Marx, Marcin Pilipczuk, MichaB Pilipczuk, Ildik Schlotter:Parameterized complexity of Eulerian deletion problems,Algorithmica, volume 68, issue 1, pp. 41-61, 2014.
[Schlotter 2] Tibor Jordn, Ildik Schlotter: Parameterized compl&'HQR[ \
T
U
X
]
ڿ~w~pibw~~w~h^[h=th^[hvh^[hTLvh^[hh^[hx8h^[h^[hahhMy*hfhL0JB*fHphq
BjhfhLUhfhLhfhhahv5hahP;|5CJ aJ hah;Ts5hahP;|5hLhahP;|hahP;|mH sH &.PQRXYZijwgd gd9H
-DM
gd3($a$gd.gdP;|gd$a$gdP;|!>UVWXYZ^_`ajQUVͻ{p{p{phaVNVNhMyB*ph"""h\?hTfB*ph"""h\?hTfh.OJQJhZ_h.OJQJh.hoC"hahP;|56CJaJmH sH "hahmn56CJaJmH sH &hahIzS56CJPJaJmH sH "hahIzS56CJaJmH sH hahv5hahP;|5hah;Tsh^[hh^[hx8h^[h^[h^[hA(Vhijwx%IJKzuaYQJC?h}h}h,h}h_*h.h_*hnhn&hnhnB*fHph"""q
h7
5hah:#5hah=t5hahA5hah7
5 h 5h\?h B*ph"""h\?h 5h\?h hah9Hhahi5mH sH hah=t5mH sH hah:#5mH sH h3(B*ph"""he(B*ph"""h\?hTfB*ph"""wxJKY Z !K"L"M"~""1*2***++,,,/gdgd(Wgdx6bgd8u7gd.$a$gd.gdRM
-DM
gd gdP;|Y Z !!!J"K"L"M"Q"R"S"T"}"~""2*+--,/./ȴmm[WSOKGKChhLOh(Wh8u7h.hoC"hahx56CJaJmH sH &hahmn56CJPJaJmH sH "hahmn56CJaJmH sH "hah56CJaJmH sH *h\?hRMh\?hRM&h\?hRMB*fHph"""q
hE)/hE)/hE)/hE)/B*ph"""&hE)/hE)/B*fHph"""q
hRMh}h_h}h,,/.//1C3D3E333)5*5+5V5W5::3=4=5=n=o=|AsBBgd;$a$gd
'gd.$a$gd.gdZ{gdP;|gdP^gdqgdxgd.//
11C3D3E3333(5)5*5+5/5051525T5V5W5ͽvdPdPdB7hahZ{mH sH hahZ{56mH sH &hahZ{56CJPJaJmH sH "hahZ{56CJaJmH sH hahi56*h.hF@~hF@~hF@~hF@~hah=thahx5hah=t5%hQY-hB*CJOJQJaJph"""h\?B*CJOJQJaJph"""h\?hQY-B*ph"""h\?hqB*ph"""&h\?hqB*fHph"""q
hahI~5W56699::::_;;2=3=4=5=m=n=o=>+>o>>??@8@zA|ApBqBrBsBwBºº²º¡peS"hah;56CJaJmH sH hah;mH sH #hqB*CJOJQJ^JaJph"""h\?hqB*ph"""&h\?hqB*fHph"""q
hMyB*fHph"""q
hwB*ph"""hmLB*ph"""hqEhmLB*ph""" *hmLhahi5mH sH hah$5mH sH h
'h
'h
'h.hh. wBzBBBHHHHH J
JJJJ%J&JMMMMMMMMʺ}vkgc\UMH@hahS5 hC{5haht5hahC{hah
'h
'he|he|he|B*ph"""hah
hah2]5mH sH hahi5mH sH hahe(mH sH hahh
hAhahimH sH hah;Ts5CJaJmH sH hh.h;mH sH "hah;56CJaJmH sH &hah;56CJPJaJmH sH BBHHHHH J
JJ%J&JMMMMMMMOOOgd:#
-DM
gd5gdigdC{
-DM
gde|gd
gd
gd;Tsgd.$a$gd.gdP;|MNNOOOOOOOPERFR6ST6U8U__U@UVUXUvUUUV>VSVźŜŤui]VOHOHOHh\?hEh\?h:hahC{hahC{5CJaJhah"_5CJaJ)hKmhoB*CJOJQJ^JaJph"""#hoB*CJOJQJ^JaJph"""h^DB*phh\?hoB*ph"""h\?h"_B*ph"""h\?h"_B*phh\?hoB*phh/h5CJaJhah#5hahSXOJQJh5B*ph"""h5h5B*ph"""OOOERFRRR8U:U____U@UVUXUsVjWGXHXYYCZ[$dd[$\$a$gdgd2gdC{$a$gdC{
-DM
gdo
-DM
gd"_gdBgd:#SVWVsVVVVV W6WgWjWyWWWWW!X"X+X.X2X@XEXFXXXYYYZZ[[[]]^ b!bccc]ddNekenetevexee»h\?hJ^h\?hnIh\?h@Ah\?hYfh\?h,Vh\?hth^Dh\?hH#h\?h$h\?hd\h\?hLh\?h5\h\?hh\?h145\h\?h14h\?h:h\?hEh\?h@x2[[[]]^^!bccddmeneeeffggghhhh
-DM
gdZgd,Vgd>Lgdt$a$gd$$a$gdLgd2eeef6fUfffgggggghh"h#h$hhhhjjjj/k2kkkkkl`lglllƻ碛kd]d]d]dh\?hEh\?h:)hkt6hkt6B*CJOJQJ^JaJph"""hkt6B*ph"""hkt6hkt6B*ph"""h^DB*ph"""hkt6hkt6h>L)hIGhZB*CJOJQJ^JaJph"""hIGhZB*ph"""hZh\?hZhG6h\?hG6h,Vh\?h,Vh\?h>Lh^Dh\?hnIh\?hJ^$hFijjkkllmmporoq;ss"uuuwwxxgd!GBgdd\-DM
gdv.$a$gd$gd2
-DM
gdkt6dd[$\$gd>Lgd>Llllllm.mjmxmmmmmmnroo0pppp!qq:s;ssssstt u"u#u{u|uuuvwwwҼҵ~wpph\?hGh\?hq h\?B*fHph"""q
&h\?hqB*fHph"""q
h\?hd\h\?hh^Dh\?h!GBh^DB*ph"""h\?hv.6B*]ph"""h\?hv.B*ph"""h\?h$h\?h5Dh\?h:h\?hYh\?hE)wwwxxxxyyyyy6z@zAzCzzzzzzz*{+{`{a{b{|V|X|||x}z}|}}&~'~J~K~L~ҷˣwowhh\?hv&hv&B*ph"""hqEhv&B*ph"""hv&hv&hch\?hWB*ph"""h\?hcB*ph"""&h\?hcB*fHph"""q
&h\?hWB*fHph"""q
h\?hch\?hWh^Dh\?h< h\?h!GBh\?ho@h\?hh\?h-(xyy6z7zb{|}K~L~~~RS!":;ڄ܄gdo@gdC{gdYgd2gd!GBL~!"ڄ܄(hԅ(h(h$8&zĉ؉BZҋDZڏȿȯȯ||h\?h$h\?h$0Jh\?h5D5\h\?h5Dh\?h5D0Jh\?hRf&0Jh\?hRf&h\?hGF0Jh\?hGF0Jh\?hEh\?h:h\?hh\?ho@h\?hssh\?hYh\?hah\?h2/܄DDڏΐϐmn78Vgd<@ 7$8$H$gd<@gdtgd;Ts$dd[$\$a$gd5DgdC{ڏϐِnvpsEVlm#$ڜۜXYacstuEǼ~zsh`Yzhw+hw+hw+mH sH h\?hw+mH sH h\?hw+hw+h(h\?h(mH sH h\?h(h\?hWMQh\?hmH sH h\?hssmH sH h\?hWMQmH sH h\?h`mH sH h\?h
NmH sH h\?h<@h\?hTfh\?h<@mH sH h\?hssh\?hth\?h;Ts"VW*+bcڜۜXY<=XYgd(W 7$8$H$gd( 7$8$H$gdWMQgdt 7$8$H$gd`gd<@EFGTUegWXYacs
CDg+,?ˡˢ=R|أ٣ĽĪĽth\?h"_B*phh\?h"_h\?hEh\?hbh\?h:h\?h#]h\?h#h(WmH sH h\?h(WmH sH h\?h(Wh(Wh\?hmH sH h\?hhhGomH sH h\?hw+mH sH hGohw+h\?hw+,
+,Z[ݢޢ>?أ٣OPxz֧اgdG6
-DM
gd"_gd# 7$8$H$gd(Wgd(Wgdt
NOYvxz֧اڧܨ!]frvܩ
-XbΪ'()5žžžžžŷžžž}h\?h$0Jh\?h#h\?h5D5\h\?h5Dh\?h5D0Jh\?hGF0Jh\?hGFh\?h(h\?hEh\?h:h\?hG6h@AhG6h\?h@Ah\?h"_h\?h"_B*phh\?h"_B*ph""".i )HI|~%&34gdo@
-DM
gde|gd
gdC{gdtgd#5ITx$34BS!"|~۾Ѿۺۈynynh\?hJB*ph"""hG6B*ph"""h\?hJh\?h h\?ho@h\?h9Hh\?h(
h\?he|he|he|B*ph"""he|h(
hGh}h}B*ph"""h}h\?h
6]h\?h
h\?h1Uh\?h
Ah\?hC{h\?h$'exity of Spare Capacity Allocation and theMulticost Steiner Subgraph problem, Journal of Discrete Algorithms 30, 29-44, 2015.
[Schlotter 3] I. Schlotter, P. Faliszewski, E. Elkind:Campaign management under approval-driven voting,to appear inAlgorithmica. doi:10.1007/s00453-015-0064-0.
[Schlotter 4] K. Cechlrov, E. Potpinkov, I. Schlotter:Refining the complexity of the sports elimination problem,Discrete Applied Mathematics, 199, 172-186.
[Schlotter 5] I. Schlotter, Computational Social Choice: Theory and Applications, DagstuhlSeminar15241.
[Schlotter 6] Haris Aziz, Ildik Schlotter, Toby Walsh: Control of Fair Division.
Proceeding of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New York City, USA, pages 67-73, 2016.
[Soltsz 1] D. Soltsz: On the 1-switch conjecture in the hypercube, Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications. Fukuoka, Japn, 2015. pp. 123-125.
[Soltsz 2] D. Soltsz: New bounds on Simonyi's conjecture, submitted
[Soltsz 3] Istvn Kovcs, Dniel Soltsz, Triangle-different Hamiltonian paths, submitted
[Soltsz 4] Ron Aharoni, Dniel Soltsz, Independent sets in the union of two Hamiltonian cycles, submitted
[Szab 1] Pter G. N. Szab, Symmetric distance formula in kantor spaces and the radius of the circumscribed sphere of affinely independent set of points, Periodica Polytechnica, 2014, accepted, doi: PPee.2094
[Szab 2] Pter G. N. Szab, Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees, Discussiones Mathematicae Graph Theory, accepted
[Szab 3] Gyula Y. Katona, Pter G. N. Szab, Bounds on the Number of Edges in Hypertrees, Discrete Mathematics,339 (7) (2016)1884--1891
[Szeszlr 1] L. Buttyn, A. Laszka, D. Szeszlr: A Minimum Cost Source Location Problem for Wireless Sensor Networks, Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Veszprm, Hungary, 2013, pages 79-88.
[Szeszlr 2] A. Laszka, L. Buttyn, D. Szeszlr: Designing robust network topologies for wireless sensor networks in adversarial environments, Pervasive and Mobile Computing, Volume 9, Issue 4, 2013, pages 546-563.
[Szeszlr 3] A. Laszka, D. Szeszlr: Hide and Seek in Digital Communication: The Steganography Game, Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Fukuoka, Japan, pp. 126-136 (2015).
[Szeszlr 4] D. Szeszlr: Security Games on Matroids, Mathematical Programming, 18, 2016.
[Tapolcai 1] J. Tapolcai, L. Rnyai, . Hosszu, Pin-Han Ho, S. Subramaniam, "Signaling Free Localization of Node Failures in All-Optical Networks", In Proc. IEEE INFOCOM, Toronto, Canada, pp. 1860-1868, 2014.
[Tapolcai 2] P. Babarczi, J. Tapolcai, L. Ronyai, M. Medard, "Resilient Flow Decomposition of Unicast Connections with Network Coding", In Proc. IEEE International Symposium on Information Theory (ISIT), pp. 116-120, Honolulu, HI, USA, 2014
[Tapolcai 3] 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. 6, 952-964. [impact factor 1.547]
[Tapolcai 4] . Hosszu, C. Fragouli, and J. Tapolcai, Combinatorial error detection in linear encoders, in Proc. High Performance Switching and Routing (HPSR), Budapest, Hungary, 2015. Best Paper
[Tapolcai 5] L. Gyimthi and J. Tapolcai, A heuristic algorithm for Network-Wide local unambiguous node failure localization, in Proc. High Performance Switching and Routing (HPSR), Budapest, Hungary, 2015.
[Tapolcai 6] L. Gyimthi, . Hosszu, and J. Tapolcai, Constructions for unambiguous node failure localization in grid topologies, inProc. Reliable Networks Design and Modeling (RNDM), Munich, Germany, 2015.
[Tapolcai 7] J. Tapolcai, L. Rnyai, . Hosszu, L. Gyimthi, 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. impact factor 1.992, 2015
[Toth 1] Gbor Simonyi, gnes Tth, A generalization of Witsenhausen's zero-error rate for directed graph, submitted (IEEE Transactions on Information Theory)
[Toth 2] Gbor Simonyi, gnes Tth, A generalization of Witsenhausen's zero-error rate for directed graphs, IEEE International Symposium on Information Theory. 2014. pp. 2864-2868.
[Toth 3] gnes Tth, On the ultimate categorical independence ratio, Journal of Combinatorial Theory Series B 108, pp. 29-39 (2014)
[Toth 4] Shinya Fujita, Michitaka Furuya, Andrs Gyrfs, gnes Tth, A Note on Covering Edge Colored Hypergraphs by Monochromatic Components, Electronic Journal of Combinatorics 21:(2), P2.33, 10 p. (2014)
[Varga 1] Gyula Y. Katona, Dniel Soltsz; Kitti Varga, Properties of minimally $t$-tough graphs, submitted to Discrete Mathematics (2016)
[Wiener 1] G. Wiener: Leaf-critic graphs, Proc. of the 3rd Bordeaux Graph Workshop, 2014, 101-102.
[Wiener 2]: P. Damaschke, A. S. Muhammad, G. Wiener: Strict Group Testing and the Set Basis Problem, Journal of Combinatorial Theory A, 2014.
[Wiener 3] G. Wiener: On non-traceable, non-hypotraceable, arachnoid graphs, Electronic Notes in Discrete Mathematics, EUROCOMB 2015
[Wiener 4] G. Wiener: Leaf-critical and leaf-stable graphs, In: Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, 267-278.
[Wiener 5] D. Gerbner, B. Keszegh, D. Plvlgyi, B. Patks, M. Vizer, G. Wiener: Finding a majority ball with majority answers, Electronic Notes in Discrete Mathematics, EUROCOMB 2015. [Wiener 6] D. Gerbner, B. Keszegh, D. Plvlgyi, G. Rote, G. Wiener: Search for the end of a path in the d-dimensional grid and in other graphs, Ars Mathematica Contemporanea
[Wiener 7] T. Fleiner, G. Wiener: Coloring signed graphs using DFS, Optimization Letters 10:(4) pp. 865-869. (2016)
[Wiener 8] G. Wiener: Leaf-critical and leaf-stable graphs. Journal of Graph Theory, appeared online: DOI 10.1002/jgt.22034 (2016)
[Wiener 9] G. Wiener: On constructions of hypotraceable graphs, Electronic Notes in Discrete Mathematics, to appear (2016)
[Wiener 10] G. Wiener: Depth first search in claw-free graphs, Extended abstract, 19th JCDCGGG, Toki, 2016.
!"}~Z[gdEgd"gdgd'
2(
Px4 #\'*.25@9-DM
gd
-DM
gdJ
p#gd gdC{gd9H)YZ[e~"$Dnɻzslseeee^h\?hXh\?hEh\?h06h\?h"h\?hTLvh\?h:h\?h^Jh\?h:^Jh\?h6B*]ph"""h^DB*ph"""h\?hB*ph"""h\?hh\?hh\?h#h\?h1h\?h h\?h B*ph"""h\?hJB*ph"""h\?hJB*ph$Hh 6VGKgq#' TZhFGRžťxqh\?h/h\?h2]h\?h7
h\?hJB*ph"""&h\?hJB*fHph"""q
h\?hJh\?h#O0Jh\?h#O0Jh\?h#Oh\?h:#h\?h$h\?h5D5\h\?h5Dh\?h!gh\?hXh\?h:h\?hE,rCiG9jHFgdJygd:#$
a$gd$gdE89jGSERٷp\p\A4h:gbB*CJOJQJ^JaJfHph"""q
&h:gbh:gbB*fHph"""q
h:gbB*fHph"""q
&hnhnB*fHph"""q
hnB*fHph"""q
h}B*fHph"""q
&h}h}B*fHph"""q
h\?h/hh\?h$h}h\?h!$_h\?h}h\?h_h\?hC{h\?h:h}h}B*ph""",1h. A!"#$%s2&6FVfv2(&6FVfv&6FVfv&6FVfv&6FVfv&6FVfv&6FVfv8XV~ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@ 0@_HmHnHsHtH@`@NormalCJ_HaJmHsHtHDA D
Default Paragraph FontRiR
0Table Normal4
l4a(k (
0No ListB^@B:#Normal (Web)dd[$\$6U`6N Hyperlink>*B*phPB@P Body Textx*$1$KHPJ^J_H9nHtH o! GFpsor"/1"GFkiadooAGFev"oQ"GFoldal*/a*#O kiadvarosB/qBLapple-converted-spacePK![Content_Types].xmlN0EH-J@%ǎǢ|ș$زULTB l,3;rØJB+$G]7O٭VvnB`2ǃ,!"E3p#9GQd; H
xuv 0F[,F᚜KsO'3w#vfSVbsؠyX p5veuw 1z@ l,i!b
IjZ2|9L$Z15xl.(zm${d:\@'23ln$^-@^i?D&|#td!6lġB"&63yy@t!HjpU*yeXry3~{s:FXI
O5Y[Y!}S˪.7bd|n]671.
tn/w/+[t6}PsںsL.J;̊iN $AI)t2Lmx:(}\-i*xQCJuWl'QyI@ھ
m2DBAR4 w¢naQ`ԲɁ
W=0#xBdT/.3-F>bYL%˓KK6HhfPQ=h)GBms]_Ԡ'CZѨys
v@c])h7Jهic?FS.NP$
e&\Ӏ+I "'%QÕ@c![paAV.9Hd<ӮHVX*%A{YrAբpxSL9":3U5U
NC(p%u@;[d`4)]t#9M4W=P5*f̰lk<_X-CwT%Ժ}B% Y,]
A̠&oʰŨ;\lc`|,bUvPK!
ѐ'theme/theme/_rels/themeManager.xml.relsM
0wooӺ&݈Э5
6?$Q
,.aic21h:qm@RN;d`o7gK(M&$R(.1r'JЊT8V"AȻHu}|$b{P8g/]QAsم(#L[PK-![Content_Types].xmlPK-!֧60_rels/.relsPK-!kytheme/theme/themeManager.xmlPK-!R%theme/theme/theme1.xmlPK-!
ѐ' theme/theme/_rels/themeManager.xml.relsPK]
./W5wBMSVelwL~ڏE5XZ[]_`acegijlnprtw,/BO[hx܄VY\^bdfhkmoqs[XL#@0(
B
S ?vvvkkpovv9*urn:schemas-microsoft-com:office:smarttagsplace=*urn:schemas-microsoft-com:office:smarttags PlaceType=*urn:schemas-microsoft-com:office:smarttags PlaceName&79>D[8=>GHKLSY]c">chcfcecgcfj l j
o
jojlQ
^
s
x
UWsy $~jvx,4578:%K|XZ^egikl Jo|8 9 !!!""F"H"""""##P#U###$$o%p%%%%%%%%%%%%&&&&&&&.'='I''6(8(((%),)-)^)b)i)j)m)**++++,,,,B-D-N-W-X-Z-------..////0!0000000%1-1f1m1o1q111/242<2D2H2I2R2S2X22#3134363D364>465D566B667>768989U999::::::::;;<<===> >">>>!?(?)?+?.?7???@4@8@=@>@@@A@C@@@@AAAAAB!B"B$BgBiBmBrBsBuBBBBBoCtCCD;EEEEEFF
FFF)F,FFFFFFFFGGGGGH'HHHHHHIxIIIIIIIIIIJJJJJJKKKMNNNOiPwPPP"Q$Q?QTQQ R'R;RERFRHRRRgShSmSoSpSrSSSSSSSSSSSSlTnTUUVVVVVVVVVVWWW W_W`WqW|WWSY\YnYyYYYY&Z'Z1Z4ZJZLZZZZZZ[
[[[[[([.[3[B[D[[[[[[[[[\\\6\\^^y_____
```(````a)a.aab)b-bbb*c,c]c_c`cgchckcccccccddRdSdddddddddddeeReteeeeeyBy+z/z0z6z8z>z?zCzJzOzPzVzzzzz={C{D{H{$|*|+|/|6|E|}}}}}}}}}}{~~~~~~~~ ǁɁρЁԁՂӄՄo !(*W\?AHL%/DMMa
#2@i+-79ԌK[`ƎَCDQ_}"ސf2Pz{ʒ̒Ւגؒ79Bǔ۔
#@L?Gg{\śțۛ|ȜҜPWmny~mŞyFd(ELXvw.ѣ,;afp~ۥݥ#$%,-/bd¦ܦަ
&&@@BBVVVVU^W^7y=y3TU!iiLL9 $$$J'K'''1)1)2)2)///=299T9T9::::>>>> >!>">">@@3@3@BBpCpCLLMMNN(R)RSSSmTVV[[]]L^L^U^V^^^``bbSeeהؔ()LLKK""//TU!iiLL9 $$$J'K'''1)1)2)2)///=299T9T9::::>>>> >!>">">@@3@3@BBpCpCLLMMNN(R)RSSSmTVV[[]]L^L^U^V^^^``bbSeeהؔ()LLKK""//TC)]Dm~GTYv3VRBHbZTtpg),]6ԜNliV,Q|28^`CJOJQJo(^`CJOJQJo(opp^p`CJOJQJo(@@^@`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(PP^P`CJOJQJo(^`CJOJQJo(^`CJOJQJo(opp^p`CJOJQJo(@@^@`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(PP^P`CJOJQJo(^`CJOJQJo(^`CJOJQJo(opp^p`CJOJQJo(@@^@`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(PP^P`CJOJQJo(^`CJOJQJo(^`CJOJQJo(opp^p`CJOJQJo(@@^@`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(PP^P`CJOJQJo(^`CJOJQJo(^`CJOJQJo(opp^p`CJOJQJo(@@^@`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(PP^P`CJOJQJo(^`CJOJQJo(^`CJOJQJo(opp^p`CJOJQJo(@@^@`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(PP^P`CJOJQJo(^`CJOJQJo(^`CJOJQJo(opp^p`CJOJQJo(@@^@`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(PP^P`CJOJQJo(^`CJOJQJo(^`CJOJQJo(opp^p`CJOJQJo(@@^@`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(^`CJOJQJo(PP^P`CJOJQJo(TY),]TC)NlQ|~3VbZT?2=@q
]~#]J2=B%ztfJ4G^tc_@q
8CrUyxH%]RJ4GUyxH!+5w@18J%'u8jJg=cX#J4G:d%8">.'c{*G=|-8#}.I/%'u87G=8ITSB;XpYMI=G=G=85w@I(pWBDMI=*8FTz}jDiG@q
J4G2=UyxH9K~flLR2=ITSW#Hjv
X2=XpYG=h6\ZG=<|;\I/c_ztla2=LbITSc8~fc0gI(pTz}jJ4G%jzt#HjMI=8kztI(phrct]zt2=%'uJ4GvJ4GIxyG=2|X}WBDys"XM
t$
a[&,
AG}@ApJy/b,V(:#$Rf&v&
'e(3(G*QY-E)/>/12B4G6kt68u7x8
7=#?o@!GBoC
D5DEGF&FGnILmL>LRMdN#OWMQIzS(W:XHXZ^[d\2]~D^P^!$_`x6b:gbdfTfYfFUg/h9KhmnGoq;Ts=tTLvwMyP;|e|w}F@~ssv
NG5_J^\?(
nLoLOaw#L7
^H#S($#SX< @x^v.c.tl314Z{sAJiY$f"cVTf $N06}I~-?KW:u8B9Hw+t2<@!gC{Yx"_Zuo|;^D@$&b)b*12@ABCIJLMnYnZ(`(adeklmnpqYYY@&P@.d@6p@@@P@T@\@`@n@v@|@ @P@@Unknown
G.Cx Times New Roman5Symbol3.*Cx Arial3.Cx Times7.[ @Verdana;.*Cx Helvetica7unifont?= *Cx Courier New;WingdingsA$BCambria Math"qցIZ"JGP)G%U7%U7!24CQHP ?P;|2! xxPeriod Closing Reportrecski
Recski Andras,Oh+'0
4@L
Xdlt|Period Closing ReportrecskinormalRecski Andras4Microsoft Office Word@V@+@@@ %՜.+,D՜.+,p,hp|
BME7UPeriod Closing ReportPeriod Closing ReportTitleCm 8@_PID_HLINKSAFhttp://cs.bme.hu/eng/period_closing_report_2015_sept_long_version.pdf
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~Root Entry FKu1TableZWordDocument.SummaryInformation(DocumentSummaryInformation8CompObjr
F Microsoft Word 97-2003 Document
MSWordDocWord.Document.89q__