default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZsolt Tuza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j309]János Balogh, József Békési, Nóra Büki
, György Dósa, Zsolt Tuza:
Extremal behavior of the Greedy algorithm for a triangle scheduling problem. Comput. Oper. Res. 169: 106718 (2024)- [j308]Anita Keszler, Zsolt Tuza:
Spectrum of 3-uniform 6- and 9-cycle systems over Kv(3)-I. Discret. Math. 347(3): 113782 (2024) - [j307]Bostjan Bresar, Csilla Bujtás, Vesna Irsic, Douglas F. Rall, Zsolt Tuza:
Indicated domination game. Discret. Math. 347(9): 114060 (2024) - [j306]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Some exact results for regular Turán problems for all large orders. Eur. J. Comb. 117: 103828 (2024) - [j305]Balázs Patkós, Zsolt Tuza, Máté Vizer:
Extremal Graph Theoretic Questions for q-Ary Vectors. Graphs Comb. 40(3): 57 (2024) - [j304]Gábor Bacsó, Balázs Patkós, Zsolt Tuza, Máté Vizer:
The Robust Chromatic Number of Graphs. Graphs Comb. 40(4): 89 (2024) - [c25]Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza:
No Tiling of the 70 × 70 Square with Consecutive Squares. FUN 2024: 28:1-28:16 - 2023
- [j303]Gyula Abraham, Peter Auer, György Dósa, Tibor Dulai, Zsolt Tuza, Agnes Werner-Stark:
The bin covering with delivery problem, extended investigations for the online case. Central Eur. J. Oper. Res. 31(1): 21-47 (2023) - [j302]Balázs Patkós, Zsolt Tuza, Máté Vizer:
Vector sum-intersection theorems. Discret. Math. 346(10): 113506 (2023) - [j301]Gyula Abraham, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza:
The board packing problem. Eur. J. Oper. Res. 308(3): 1056-1073 (2023) - [j300]Péter Bence Czaun, Pál Pusztai, Levente Sebok, Zsolt Tuza:
Minimal Non-C-Perfect Hypergraphs with Circular Symmetry. Symmetry 15(5): 1114 (2023) - [j299]Zsolt Tuza:
Gregarious Decompositions of Complete Equipartite Graphs and Related Structures. Symmetry 15(12): 2097 (2023) - 2022
- [j298]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Saturation problems with regularity constraints. Discret. Math. 345(8): 112921 (2022) - [j297]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Singular Turán numbers and WORM-colorings. Discuss. Math. Graph Theory 42(4): 1061-1074 (2022) - [j296]Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer:
On saturation of Berge hypergraphs. Eur. J. Comb. 102: 103477 (2022) - [j295]Suresh Dara, Suchismita Mishra, Narayanan Narayanan, Zsolt Tuza:
Strong Edge Coloring of Cayley Graphs and Some Product Graphs. Graphs Comb. 38(2): 51 (2022) - [j294]Sylwia Cichacz, Zsolt Tuza:
Realization of digraphs in Abelian groups and its consequences. J. Graph Theory 100(2): 331-345 (2022) - [j293]Csilla Bujtás, Marko Jakovac, Zsolt Tuza:
The k-path vertex cover: General bounds and chordal graphs. Networks 80(1): 63-76 (2022) - [j292]János Balogh, György Dósa, Lars Magnus Hvattum, Tomas Olaj, Zsolt Tuza:
Guillotine cutting is asymptotically optimal for packing consecutive squares. Optim. Lett. 16(9): 2775-2785 (2022) - 2021
- [j291]Csilla Bujtás, Mario Gionfriddo, Elena Guardo, Lorenzo Milazzo, Salvatore Milici, Zsolt Tuza:
Complex uniformly resolvable decompositions of K_v. Ars Math. Contemp. 21(1) (2021) - [j290]Arnfried Kemnitz, Massimiliano Marangio, Zsolt Tuza, Margit Voigt:
Comparison of sum choice number with chromatic sum. Discret. Math. 344(7): 112391 (2021) - [j289]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Tilen Marc, Balázs Patkós, Zsolt Tuza, Máté Vizer:
On Grundy total domination number in product graphs. Discuss. Math. Graph Theory 41(1): 225-247 (2021) - [j288]Sylwia Cichacz, Agnieszka Görlich, Zsolt Tuza:
Z2× Z2-cordial cycle-free hypergraphs. Discuss. Math. Graph Theory 41(4): 1021-1040 (2021) - [j287]József Balogh, Gyula O. H. Katona, William Linz, Zsolt Tuza:
The domination number of the graph defined by two levels of the n-cube, II. Eur. J. Comb. 91: 103201 (2021) - [j286]György Dósa, Nicholas Newman, Zsolt Tuza, Vitaly I. Voloshin:
Coloring Properties of Mixed Cycloids. Symmetry 13(8): 1539 (2021) - [j285]György Dósa, Hans Kellerer, Tomas Olaj, Zsolt Tuza:
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time. Theor. Comput. Sci. 880: 69-81 (2021) - 2020
- [j284]Mario Gionfriddo, Lorenzo Milazzo, Zsolt Tuza:
Hypercycle systems. Australas. J Comb. 77: 336-354 (2020) - [j283]Yair Caro, Zsolt Tuza:
Regular Turán numbers. Australas. J Comb. 78: 133-144 (2020) - [j282]Mieczyslaw Borowiecki, Anna Fiedorowicz, Elzbieta Sidorowicz, Zsolt Tuza:
Independent (k+1)-domination in k-trees. Discret. Appl. Math. 284: 99-110 (2020) - [j281]Csilla Bujtás, Akbar Davoodi, Ervin Györi, Zsolt Tuza:
Clique coverings and claw-free graphs. Eur. J. Comb. 88: 103114 (2020) - [j280]Csilla Bujtás, Stanislav Jendrol', Zsolt Tuza:
On Specific Factors in Graphs. Graphs Comb. 36(5): 1391-1399 (2020) - [j279]Csilla Bujtás, Stanislav Jendrol', Zsolt Tuza:
On caterpillar factors in graphs. Theor. Comput. Sci. 846: 82-90 (2020)
2010 – 2019
- 2019
- [j278]Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs. Algorithmica 81(2): 421-438 (2019) - [j277]György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek:
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum. Central Eur. J. Oper. Res. 27(4): 1107-1130 (2019) - [j276]Csilla Bujtás, Zsolt Tuza:
Fractional Domination Game. Electron. J. Comb. 26(4): 4 (2019) - [j275]Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Domination game on uniform hypergraphs. Discret. Appl. Math. 258: 65-75 (2019) - [j274]Leila Badakhshian, Gyula O. H. Katona, Zsolt Tuza:
The domination number of the graph defined by two levels of the n-cube. Discret. Appl. Math. 266: 30-37 (2019) - [j273]Cristina Bazgan, Henning Fernau, Zsolt Tuza:
Aspects of upper defensive alliances. Discret. Appl. Math. 266: 111-120 (2019) - [j272]György Dósa, Hans Kellerer, Zsolt Tuza:
Using weight decision for decreasing the price of anarchy in selfish bin packing games. Eur. J. Oper. Res. 278(1): 160-169 (2019) - [j271]Gábor Bacsó, Csilla Bujtás, Casey Tompkins, Zsolt Tuza:
Disjoint Paired-Dominating sets in Cubic Graphs. Graphs Comb. 35(5): 1129-1138 (2019) - [j270]György Dósa, Hans Kellerer, Zsolt Tuza:
Restricted assignment scheduling with resource constraints. Theor. Comput. Sci. 760: 72-87 (2019) - [j269]Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza:
Finding a potential community in networks. Theor. Comput. Sci. 769: 32-42 (2019) - 2018
- [j268]Csilla Bujtás, Zsolt Tuza:
Partition-Crossing Hypergraphs. Acta Cybern. 23(3): 815-828 (2018) - [j267]Zsolt Tuza:
Mixed hypergraphs and beyond. Art Discret. Appl. Math. 1(2): #P2.05 (2018) - [j266]Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza:
A General Bin Packing Game: Interest Taken into Account. Algorithmica 80(5): 1534-1555 (2018) - [j265]György Dósa, Armin Fügenschuh, Zhiyi Tan, Zsolt Tuza, Krzysztof Wesek:
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum. Central Eur. J. Oper. Res. 26(1): 161-180 (2018) - [j264]György Dósa, Zsolt Tuza:
Multiprofessor scheduling. Discret. Appl. Math. 234: 195-209 (2018) - [j263]Gergely Kovács, Zsolt Tuza, Béla Vizvári, Hajieh K. Jabbari:
A note on the polytope of bipartite TSP. Discret. Appl. Math. 235: 92-100 (2018) - [j262]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. 36(4): 1221-1242 (2018) - [j261]Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Abdelhakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical dominating sets in vertex-coloured graphs. J. Discrete Algorithms 48: 27-41 (2018) - [j260]Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza:
Safe sets, network majority on weighted trees. Networks 71(1): 81-92 (2018) - [c24]György Dósa, Hans Kellerer, Zsolt Tuza:
Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy. WAOA 2018: 204-217 - [i5]Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen:
Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs. CoRR abs/1804.04077 (2018) - 2017
- [j259]Csilla Bujtás, Zsolt Tuza:
F-WORM colorings: Results for 2-connected graphs. Discret. Appl. Math. 231: 131-138 (2017) - [j258]Peter Horák, Igor A. Semaev, Zsolt Tuza:
A combinatorial problem related to sparse systems of equations. Des. Codes Cryptogr. 85(1): 129-144 (2017) - [j257]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Grundy dominating sequences and zero forcing sets. Discret. Optim. 26: 66-77 (2017) - [j256]Gábor Bacsó, Zdenek Ryjácek, Zsolt Tuza:
Coloring the cliques of line graphs. Discret. Math. 340(11): 2641-2649 (2017) - [j255]Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer:
The minimum number of vertices in uniform hypergraphs with given domination number. Discret. Math. 340(11): 2704-2713 (2017) - [j254]Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Bounds on the game transversal number in hypergraphs. Eur. J. Comb. 59: 34-50 (2017) - [j253]Zsolt Tuza:
Graph labeling games. Electron. Notes Discret. Math. 60: 61-68 (2017) - [j252]Johanne Cohen, Yannis Manoussakis, Hong Phong Pham, Zsolt Tuza:
Tropical matchings in vertex-colored graphs. Electron. Notes Discret. Math. 62: 219-224 (2017) - [c23]Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza:
On the Complexity of Finding a Potential Community. CIAC 2017: 80-91 - 2016
- [j251]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence. Ars Comb. 128: 165-173 (2016) - [j250]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Dominating Sequences in Grid-Like and Toroidal Graphs. Electron. J. Comb. 23(4): 4 (2016) - [j249]Bernadett Ács, Gábor Szederkényi, Zsolt Tuza, Zoltán A. Tuza:
Computing all possible graph structures describing linearly conjugate realizations of kinetic systems. Comput. Phys. Commun. 204: 11-20 (2016) - [j248]S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Induced cycles in triangle graphs. Discret. Appl. Math. 209: 264-275 (2016) - [j247]Ewa Drgas-Burchardt, Kamila Kowalska, Jerzy Michael, Zsolt Tuza:
Some properties of vertex-oblique graphs. Discret. Math. 339(1): 95-102 (2016) - [j246]Csilla Bujtás, Zsolt Tuza:
The Disjoint Domination Game. Discret. Math. 339(7): 1985-1992 (2016) - [j245]Csilla Bujtás, Zsolt Tuza:
K3-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum. Discuss. Math. Graph Theory 36(3): 759-772 (2016) - [j244]Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza:
Network Majority on Tree Topological Network. Electron. Notes Discret. Math. 54: 79-84 (2016) - [j243]Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game. SIAM J. Discret. Math. 30(3): 1830-1847 (2016) - [j242]Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza:
New models of graph-bin packing. Theor. Comput. Sci. 640: 94-103 (2016) - [c22]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe Sets in Graphs: Graph Classes and Structural Parameters. COCOA 2016: 241-253 - [c21]Gábor Bacsó, Dániel Marx, Zsolt Tuza:
H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms. IPEC 2016: 3:1-3:12 - [c20]Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, Narayanan Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical Dominating Sets in Vertex-Coloured Graphs. WALCOM 2016: 17-27 - 2015
- [j241]Mate Barany, Zsolt Tuza:
Circular coloring of graphs via linear programming and tabu search. Central Eur. J. Oper. Res. 23(4): 833-848 (2015) - [j240]Csilla Bujtás, Zsolt Tuza:
Maximum number of colors in hypertrees of bounded degree. Central Eur. J. Oper. Res. 23(4): 867-876 (2015) - [j239]S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Generalized Line Graphs: Cartesian Products and Complexity of Recognition. Electron. J. Comb. 22(3): 3 (2015) - [j238]István Szalkai, Zsolt Tuza:
Minimum number of affine simplices of given dimension. Discret. Appl. Math. 180: 141-149 (2015) - [j237]Csilla Bujtás, Zsolt Tuza:
Turán numbers and batch codes. Discret. Appl. Math. 186: 45-55 (2015) - [j236]Peter Horák, Zsolt Tuza:
Speeding up deciphering by hypergraph ordering. Des. Codes Cryptogr. 75(1): 175-185 (2015) - [j235]Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza:
Minimum order of graphs with given coloring parameters. Discret. Math. 338(4): 621-632 (2015) - [j234]Veronika Halász, Zsolt Tuza:
Distance-constrained labeling of complete trees. Discret. Math. 338(8): 1398-1406 (2015) - [j233]Selda Küçükçifçi, Salvatore Milici, Zsolt Tuza:
Maximum uniformly resolvable decompositions of Kv and Kv-I into 3-stars and 3-cycles. Discret. Math. 338(10): 1667-1673 (2015) - [j232]Csilla Bujtás, Zsolt Tuza:
Approximability of the upper chromatic number of hypergraphs. Discret. Math. 338(10): 1714-1721 (2015) - [j231]Peter Horák, Igor A. Semaev, Zsolt Tuza:
An application of Combinatorics in Cryptography. Electron. Notes Discret. Math. 49: 31-35 (2015) - [j230]Michael Stiebitz, Zsolt Tuza, Margit Voigt:
Orientations of Graphs with Prescribed Weighted Out-Degrees. Graphs Comb. 31(1): 265-280 (2015) - [j229]Nathann Cohen, Zsolt Tuza:
Induced Decompositions of Highly Dense Graphs. J. Graph Theory 78(2): 97-107 (2015) - [j228]János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Zsolt Tuza:
Online Results for Black and White Bin Packing. Theory Comput. Syst. 56(1): 137-155 (2015) - [j227]János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza:
Offline black and white bin packing. Theor. Comput. Sci. 596: 92-101 (2015) - [c19]Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza:
Bin Packing Game with an Interest Matrix. COCOON 2015: 57-69 - [i4]Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical Dominating Sets in Vertex-Coloured Graphs. CoRR abs/1503.01008 (2015) - 2014
- [j226]Salvatore Milici, Gaetano Quattrocchi, Zsolt Tuza:
G-designs without blocking sets, Note. Ars Comb. 114: 229-233 (2014) - [j225]Csilla Bujtás, Michael A. Henning, Zsolt Tuza, Anders Yeo:
Total Transversals and Total Domination in Uniform Hypergraphs. Electron. J. Comb. 21(2): 2 (2014) - [j224]Salvatore Milici, Zsolt Tuza:
Uniformly resolvable decompositions of Kv into P3 and K3 graphs. Discret. Math. 331: 137-141 (2014) - [j223]Enrico Angelelli, Cristina Bazgan, Maria Grazia Speranza, Zsolt Tuza:
Complexity and approximation for Traveling Salesman Problems with profits. Theor. Comput. Sci. 531: 54-65 (2014) - 2013
- [j222]Attila Benko, György Dósa, Zsolt Tuza:
Bin covering with a general profit function: approximability results. Central Eur. J. Oper. Res. 21(4): 805-816 (2013) - [j221]S. Arumugam, Bibin K. Jose, Csilla Bujtás, Zsolt Tuza:
Equality of domination and transversal numbers in hypergraphs. Discret. Appl. Math. 161(13-14): 1859-1867 (2013) - [j220]Csilla Bujtás, Zsolt Tuza:
Color-bounded hypergraphs, VI: Structural and functional jumps in complexity. Discret. Math. 313(19): 1965-1977 (2013) - [j219]Zsolt Tuza:
Problems on cycles and colorings. Discret. Math. 313(19): 2007-2013 (2013) - [j218]Gyula O. H. Katona, Zsolt Tuza:
Color the cycles. Discret. Math. 313(19): 2026-2033 (2013) - [j217]Sylwia Cichacz, Agnieszka Görlich, Zsolt Tuza:
Cordial labeling of hypertrees. Discret. Math. 313(22): 2518-2524 (2013) - [j216]Zsolt Tuza:
Choice-perfect graphs. Discuss. Math. Graph Theory 33(1): 231-242 (2013) - [j215]Július Czap, Zsolt Tuza:
Decompositions of plane graphs under parity constrains given by faces. Discuss. Math. Graph Theory 33(3): 521-530 (2013) - [j214]Arnfried Kemnitz, Massimiliano Marangio, Zsolt Tuza:
$$[1, 1, t]$$ -Colorings of Complete Graphs. Graphs Comb. 29(4): 1041-1050 (2013) - [j213]Máté Hegyháti, Zsolt Tuza:
Colorability of mixed hypergraphs and their chromatic inversions. J. Comb. Optim. 25(4): 737-751 (2013) - [j212]György Dósa, Zsolt Tuza, Deshi Ye:
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations. J. Comb. Optim. 26(3): 416-436 (2013) - [j211]Anita Keszler, Tamás Szirányi, Zsolt Tuza:
Dense subgraph mining with a mixed graph model. Pattern Recognit. Lett. 34(11): 1252-1262 (2013) - [j210]György Dósa, Rongheng Li, Xin Han, Zsolt Tuza:
Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9. Theor. Comput. Sci. 510: 13-61 (2013) - [c18]Gábor Bacsó, Anita Keszler, Zsolt Tuza:
Matching Matchings. ECBS-EERC 2013: 85-94 - [i3]Peter Horák, Zsolt Tuza:
Speeding up Deciphering by Hypergraph Ordering. CoRR abs/1309.5292 (2013) - [i2]Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza:
Minimum order of graphs with given coloring parameters. CoRR abs/1312.7522 (2013) - 2012
- [j209]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
3-consecutive edge coloring of a graph. Discret. Math. 312(3): 561-573 (2012) - [j208]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
Vertex coloring without large polychromatic stars. Discret. Math. 312(14): 2102-2108 (2012) - [j207]Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro Montero, Zsolt Tuza:
Proper connection of graphs. Discret. Math. 312(17): 2550-2560 (2012) - [j206]Gábor Bacsó, Zsolt Tuza:
Distance domination versus iterated domination. Discret. Math. 312(17): 2672-2675 (2012) - [j205]