![](img/space.gif) |
Modellek és algoritmusok a műszaki informatikában felmerült kombinatorikus problémákra
|
súgó
nyomtatás
|
Ezen az oldalon az NKFI Elektronikus Pályázatkezelő Rendszerében nyilvánosságra hozott projektjeit tekintheti meg.
vissza »![](img/space.gif)
![](img/space.gif)
![](img/space.gif)
![](img/space.gif)
|
![](img/print_ver.gif) |
Közleményjegyzék |
|
|
M. Barany, B. Bertok, Z. Kovacs, F. Friedler and L. T. Fan: Optimization software for solving vehicle assignment problems to minimize cost and environmental impact of transportation, Chemical Engineering Transactions, 21, 499-504, 2010 | Cs. Bujtás, E. Sampathkumar, Zs. Tuza, L. Pushpalatha and Vasundhara R. C.: Improper C-colorings of graphs, Discrete Applied Mathematics, 159, 174-186, 2011 | S. Aparna Lakshmanan, Cs. Bujtás and Zs. Tuza: Small edge sets meeting all triangles of a graph, Graphs and Combinatorics, 28, 381-392, 2012 | K. Kalauz, Z. Süle, B. Bertok, F. Friedler and L. T. Fan: Generation of redundant structures to guarantee predefined level of reliability in business processes, VOCAL 2010 (Veszprém Optimization Conference: Advanced Algorithms), Veszprém, Hungary, December 13-15, 2010 | B. Bertok, K. Kalauz, Z. Süle, L. T. Fan and F. Friedler: Algorithmic synthesis of process networks with time constraints by the P-garph framework, VOCAL 2010 (Veszprém Optimization Conference: Advanced Algorithms), Veszprém, Hungary, December 13-15, 2010 | M. Barany, B. Bertok, L. T. Fan and F. Friedler: Relationship between extreme pathways and structurally minimal pathways, Bioprocess and Biosystems Engineering, 36, 1199-1203, 2013 | K. Kalauz, Z. Sule, B. Bertok, F. Friedler and L. T. Fan: Reliability analysis of business processes via the P-graph framework, International Conference on Computational Management Science, Vienna, Austria, July 28-30, 2010 | B. Bertok, R. Adonyi, F. Friedler and L. T. Fan: Superstructure approach to batch process scheduling by S-graph Representation, Computer-Aided Chemical Engineering, 29, 1105-1109, 2011 | M. Barany, B. Bertok, Z. Kovacs, F. Friedler and L. T. Fan: Solving vehicle assignment problems by process-network synthesis to minimize cost and environmental impact of transportation, Clean Technologies and Environmental Policy, 13, 637-642, 2011 | M. Barany, B.Bertok, C. Imreh, L. T. Fan and F. Friedler: On the equivalence of direct mechanisms and structurally minimal pathways, Journal of Mathematical Chemistry, 50, 1347-1361, 2012 | Cs. Bujtás and Zs. Tuza: Combinatorial batch codes: Extremal problems under Hall-type conditions, Electronic Notes in Discrete Mathematics, 38, 201-206, 2011 | Cs. Bujtás and Zs. Tuza: Relaxations of Hall's Condition: Optimal batch codes with multiple queries, Applicable Analysis and Discrete Mathematics, 6, 72-81, 2012 | G. Bacsó and Zs. Tuza: Optimal guard sets and the Helly property, European Journal of Combinatorics, 32, 28-32, 2011 | C. Bazgan, S. Toubaline and Zs. Tuza: Complexity of most vital nodes for Independent Set in graphs related to tree structures, Lecture Notes in Computer Science 6460, 154-166, 2011 | C. Bazgan, S. Toubaline and Zs. Tuza: The most vital nodes with respect to Independent Set and Vertex Cover, Discrete Applied Mathematics, 159, 1933-1946, 2011 | G. Bacsó and Zs. Tuza: Distance domination versus iterated domination, Discrete Mathematics, 312, 2672-2675, 2012 | Cs. Bujtás, Gy. Dósa, Cs. Imreh, J. Nagy-György and Zs. Tuza: The Graph-Bin Packing Problem, International Journal of Foundations of Computer Science, 22, 1971-1993, 2011 | Cs. Bujtás and Zs. Tuza: Maximum number of colors: C-coloring and related problems, Journal of Geometry 101, 83-97, 2011 | Cs. Bujtás and Zs. Tuza: Optimal batch codes: Many items or low retrieval requirement, Advances in Mathematics of Communications, 5, 529-541, 2011 | Cs. Bujtás and Zs. Tuza: Optimal combinatorial batch codes derived from dual systems, Miskolc Mathematical Notes, 12, 11–23, 2011 | Cs. Bujtás, E. Sampathkumar, Zs. Tuza, Ch. Dominic and L. Pushpalatha: 3-consecutive edge coloring of a graph, Discrete Mathematics, 312, 561-573, 2012 | Cs. Bujtás, E. Sampathkumar, Zs. Tuza, Ch. Dominic and L. Pushpalatha: Vertex coloring without large polychromatic stars, Discrete Mathematics, 312, 2102-2108, 2012 | Cs. Bujtás, M. A. Henning and Zs. Tuza: Transversals and domination in uniform hypergraphs, European Journal of Combinatorics, 33, 62-72, 2012 | V. Borozan, S. Fujita, A. Gerek, C. Magnant, Y. Manoussakis, L. Montero and Zs. Tuza: Proper connection of graphs, Discrete Mathematics 312, 2550-2560, 2012 | I. Szalkai, Gy. Dosa, Zs. Tuza and B. Szalkai: On minimal solutions of systems of linear equations with applications, Miskolc Mathematical Notes, 13, 529-541, 2012 | G. Szederkényi, K. M. Hangos and Z Tuza: Finding weakly reversible realizations of chemical reaction networks using optimization, MATCH - Communications in Mathematical and in Computer Chemistry, 67, 193-212, 2012 | D. W. Cranston, A. Pruchnewski, Zs. Tuza and M. Voigt: List colorings of K5-minor-free graphs with special list assignments, Journal of Graph Theory, 71, 18-30, 2012 | Zs. Tuza: Choice-perfect graphs, Discussiones Mathematicae Graph Theory, 33, 231-242, 2013 | A. Kemnitz, M. Marangio and Zs. Tuza: [1,1,t]-colorings of complete graphs, Graphs and Combinatorics, 29, 1041-1050, 2013 | Gy. Dósa, Zs. Tuza and D. Ye: Bin packing with "Largest In Bottom" constraint: Tighter bounds and generalizations, Journal of Combinatorial Optimization, 26, 416-436, 2013 | A. Benkő, Gy. Dósa and Zs. Tuza: Bin covering with a general profit function: approximability results, Central European Journal of Operations Research, 21, 805-816, 2013 | J. Balogh, J. Békési, Gy. Dósa, H. Kellerer and Zs. Tuza: Black and white bin packing, Lecture Notes in Computer Science 7846, 131-144, 2013 | M. Hegyháti and Zs. Tuza: Colorability of mixed hypergraphs and their chromatic inversions, Journal of Combinatorial Optimization, 25, 737-751, 2013 | J. Czap and Zs. Tuza: Decompositions of plane graphs under parity constraints given by faces, Discussiones Mathematicae Graph Theory, 33, 521-530, 2013 | Cs. Bujtás: Domination game on trees without leaves at distance four, Proc. 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (A. Frank et al., eds.), June 4-7, 2013, Veszprém, Hungary, pp. 73-78, 2013 | S. Arumugam, Bibin K. Jose, Cs. Bujtás and Zs. Tuza: Equality of domination and transversal numbers in hypergraphs, Discrete Applied Mathematics 161, 1859-1867, 2013 | Cs. Bujtás, E. Sampathkumar, Zs. Tuza, Ch. Dominic and L. Pushpalatha: When the vertex coloring of a graph is an edge coloring of its line graph - A rare coincidence, Ars Combinatoria („közlésre elfogadva”), 2015 | S. Aparna Lakshmanan, Cs. Bujtás and Zs. Tuza: Generalized line graphs: Cartesian products and complexity of recognition, („közlésre benyújtva”), 2015 | Cs.Bujtás and Zs.Tuza: Color-bounded hypergraphs, VI: Structural and functional jumps in complexity, Discrete Mathematics 313, 1965-1977, 2013 | Cs. Bujtás and Zs. Tuza: Approximability of the upper chromatic number of hypergraphs, („közlésre benyújtva”), 2015 | Cs. Bujtás and Zs. Tuza: Maximum number of colors in hypertrees of bounded degree, („közlésre benyújtva”), 2015 | Cs. Bujtás, M. A. Henning, Zs. Tuza and A. Yeo: Total transversals and total domination in uniform hypergraphs, („közlésre benyújtva”), 2015 | Cs. Bujtás and Zs. Tuza: Turán numbers and batch codes, („közlésre benyújtva”), 2015 | Gy. Dósa, R. Li, X. Han and Zs. Tuza: Tight absolute bound for First Fit Decreasing bin-packing: FFD(L) ≤ 11/9 OPT(L) + 6/9, Theoretical Computer Science 510, 13–61, 2013 | Gy. Dosa, Z. Tan, Zs. Tuza, Y. Yan and C. Sik Lányi: Improved bounds for batch scheduling with nonidentical job sizes, („közlésre benyújtva”), 2015 | P. Horak and Zs. Tuza: Speeding up deciphering by hypergraph ordering, Designs, Codes and Cryptography („közlésre elfogadva”), 2014 | Zs. Tuza and Cs. Bujtás: Coloring problems on interval hypergraphs, Midsummer Combinatorial Workshop 2012, Prague, KAM-DIMATIA Series, 39-41, 2013 |
![](img/space.gif)
|
|
|
![](img/shadow_right_up.gif)
|
![](img/shadow_left_bottom.gif)
|
![](img/shadow_right_bottom.gif)
|
![](img/space.gif) vissza »
|
![](img/space.gif) |
|