Zsolt Tuza

Discret. Appl. Math., 2025

Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard.

[BibT_eX]

[DOI]

András Éles

Angshuman Robin Goswami

István Szalkai

Algorithms, 2025

2024

The Robust Chromatic Number of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., August, 2024

Extremal Graph Theoretic Questions for q-Ary Vectors.

[BibT_eX]

[DOI]

Balázs Patkós

Máté Vizer

Graphs Comb., May, 2024

Some exact results for regular Turán problems for all large orders.

[BibT_eX]

[DOI]

Eur. J. Comb., March, 2024

Spectrum of 3-uniform 6- and 9-cycle systems over Kv(3)-I.

[BibT_eX]

[DOI]

Discret. Math., March, 2024

Counting connected partitions of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2024

Indicated domination game.

[BibT_eX]

[DOI]

Discret. Math., 2024

Extremal behavior of the Greedy algorithm for a triangle scheduling problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2024

Connected Turán number of trees.

[BibT_eX]

[DOI]

Balázs Patkós

Ars Math. Contemp., 2024

Optimal strategies in fractional games: vertex cover and domination.

[BibT_eX]

[DOI]

Günter Rote

Ars Math. Contemp., 2024

No Tiling of the 70 × 70 Square with Consecutive Squares.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023

Gregarious Decompositions of Complete Equipartite Graphs and Related Structures.

[BibT_eX]

[DOI]

Symmetry, December, 2023

The board packing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., August, 2023

The bin covering with delivery problem, extended investigations for the online case.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., March, 2023

Minimal Non-C-Perfect Hypergraphs with Circular Symmetry.

[BibT_eX]

[DOI]

Symmetry, 2023

Vector sum-intersection theorems.

[BibT_eX]

[DOI]

Balázs Patkós

Máté Vizer

Discret. Math., 2023

2022

Guillotine cutting is asymptotically optimal for packing consecutive squares.

[BibT_eX]

[DOI]

Optim. Lett., 2022

The k-path vertex cover: General bounds and chordal graphs.

[BibT_eX]

[DOI]

Marko Jakovac

Networks, 2022

Realization of digraphs in Abelian groups and its consequences.

[BibT_eX]

[DOI]

Sylwia Cichacz

J. Graph Theory, 2022

Strong Edge Coloring of Cayley Graphs and Some Product Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2022

On saturation of Berge hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

Singular Turán numbers and WORM-colorings.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

Saturation problems with regularity constraints.

[BibT_eX]

[DOI]

Discret. Math., 2022

2021

An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Coloring Properties of Mixed Cycloids.

[BibT_eX]

[DOI]

Symmetry, 2021

The domination number of the graph defined by two levels of the n-cube, II.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Z2× Z2-cordial cycle-free hypergraphs.

[BibT_eX]

[DOI]

Sylwia Cichacz

Agnieszka Görlich

Discuss. Math. Graph Theory, 2021

On Grundy total domination number in product graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

Comparison of sum choice number with chromatic sum.

[BibT_eX]

[DOI]

Arnfried Kemnitz

Massimiliano Marangio

Discret. Math., 2021

Complex uniformly resolvable decompositions of K_v.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2021

2020

On caterpillar factors in graphs.

[BibT_eX]

[DOI]

Stanislav Jendrol'

Theor. Comput. Sci., 2020

On Specific Factors in Graphs.

[BibT_eX]

[DOI]

Stanislav Jendrol'

Graphs Comb., 2020

Clique coverings and claw-free graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Independent (k+1)-domination in k-trees.

[BibT_eX]

[DOI]

Anna Fiedorowicz

Elzbieta Sidorowicz

Discret. Appl. Math., 2020

Hypercycle systems.

[BibT_eX]

[DOI]

Australas. J Comb., 2020

Regular Turán numbers.

[BibT_eX]

[DOI]

Australas. J Comb., 2020

2019

Restricted assignment scheduling with resource constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Finding a potential community in networks.

[BibT_eX]

[DOI]

Thomas Pontoizeau

Theor. Comput. Sci., 2019

Disjoint Paired-Dominating sets in Cubic Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2019

Using weight decision for decreasing the price of anarchy in selfish bin packing games.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Domination game on uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Aspects of upper defensive alliances.

[BibT_eX]

[DOI]

Henning Fernau

Discret. Appl. Math., 2019

The domination number of the graph defined by two levels of the n-cube.

[BibT_eX]

[DOI]

Leila Badakhshian

Gyula O. H. Katona

Discret. Appl. Math., 2019

Fractional Domination Game.

[BibT_eX]

[DOI]

Jean-Alexandre Anglès d'Auriac

Electron. J. Comb., 2019

Tight lower bounds for semi-online scheduling on two uniform machines with known optimum.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2019

Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Safe sets, network majority on weighted trees.

[BibT_eX]

[DOI]

Networks, 2018

Tropical dominating sets in vertex-coloured graphs.

[BibT_eX]

[DOI]

Abdelhakim El Maftouhi

J. Discrete Algorithms, 2018

Safe sets in graphs: Graph classes and structural parameters.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

A note on the polytope of bipartite TSP.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Multiprofessor scheduling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs.

[BibT_eX]

[DOI]

CoRR, 2018

Tight upper bounds for semi-online scheduling on two uniform machines with known optimum.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2018

A General Bin Packing Game: Interest Taken into Account.

[BibT_eX]

[DOI]

Algorithmica, 2018

Mixed hypergraphs and beyond.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2018

Partition-Crossing Hypergraphs.

[BibT_eX]

[DOI]

Acta Cybern., 2018

Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

2017

Graph labeling games.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Tropical matchings in vertex-colored graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Bounds on the game transversal number in hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

The minimum number of vertices in uniform hypergraphs with given domination number.

[BibT_eX]

[DOI]

Discret. Math., 2017

Coloring the cliques of line graphs.

[BibT_eX]

[DOI]

Zdenek Ryjácek

Discret. Math., 2017

Grundy dominating sequences and zero forcing sets.

[BibT_eX]

[DOI]

Discret. Optim., 2017

A combinatorial problem related to sparse systems of equations.

[BibT_eX]

[DOI]

Igor A. Semaev

Des. Codes Cryptogr., 2017

F-WORM colorings: Results for 2-connected graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

On the Complexity of Finding a Potential Community.

[BibT_eX]

[DOI]

Thomas Pontoizeau

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

New models of graph-bin packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Network Majority on Tree Topological Network.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

K3-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

Some properties of vertex-oblique graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

The Disjoint Domination Game.

[BibT_eX]

[DOI]

Discret. Math., 2016

Induced cycles in triangle graphs.

[BibT_eX]

[DOI]

S. Aparna Lakshmanan

Jean-Alexandre Anglès d'Auriac

Discret. Appl. Math., 2016

Computing all possible graph structures describing linearly conjugate realizations of kinetic systems.

[BibT_eX]

[DOI]

Comput. Phys. Commun., 2016

Dominating Sequences in Grid-Like and Toroidal Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence.

[BibT_eX]

Ars Comb., 2016

Tropical Dominating Sets in Vertex-Coloured Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms.

[BibT_eX]

[DOI]

Dániel Marx

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Offline black and white bin packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Online Results for Black and White Bin Packing.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

Induced Decompositions of Highly Dense Graphs.

[BibT_eX]

[DOI]

Nathann Cohen

J. Graph Theory, 2015

Orientations of Graphs with Prescribed Weighted Out-Degrees.

[BibT_eX]

[DOI]

Michael Stiebitz

Graphs Comb., 2015

An application of Combinatorics in Cryptography.

[BibT_eX]

[DOI]

Igor A. Semaev

Electron. Notes Discret. Math., 2015

Maximum uniformly resolvable decompositions of Kv and Kv-I into 3-stars and 3-cycles.

[BibT_eX]

[DOI]

Selda Küçükçifçi

Discret. Math., 2015

Distance-constrained labeling of complete trees.

[BibT_eX]

[DOI]

Veronika Halász

Discret. Math., 2015

Approximability of the upper chromatic number of hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Minimum order of graphs with given coloring parameters.

[BibT_eX]

[DOI]

Discret. Math., 2015

Speeding up deciphering by hypergraph ordering.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

Minimum number of affine simplices of given dimension.

[BibT_eX]

[DOI]

István Szalkai

Discret. Appl. Math., 2015

Turán numbers and batch codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Generalized Line Graphs: Cartesian Products and Complexity of Recognition.

[BibT_eX]

[DOI]

S. Aparna Lakshmanan

Electron. J. Comb., 2015

Maximum number of colors in hypertrees of bounded degree.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2015

Circular coloring of graphs via linear programming and tabu search.

[BibT_eX]

[DOI]

Mate Barany

Central Eur. J. Oper. Res., 2015

Bin Packing Game with an Interest Matrix.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Complexity and approximation for Traveling Salesman Problems with profits.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Uniformly resolvable decompositions of Kv into P3 and K3 graphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

Total Transversals and Total Domination in Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

G-designs without blocking sets, Note.

[BibT_eX]

Gaetano Quattrocchi

Ars Comb., 2014

2013

Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Dense subgraph mining with a mixed graph model.

[BibT_eX]

[DOI]

Tamás Szirányi

Pattern Recognit. Lett., 2013

Colorability of mixed hypergraphs and their chromatic inversions.

[BibT_eX]

[DOI]

Máté Hegyháti

J. Comb. Optim., 2013

Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations.

[BibT_eX]

[DOI]

Deshi Ye

J. Comb. Optim., 2013

$$[1, 1, t]$$ -Colorings of Complete Graphs.

[BibT_eX]

[DOI]

Arnfried Kemnitz

Massimiliano Marangio

Graphs Comb., 2013

Choice-perfect graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

Decompositions of plane graphs under parity constrains given by faces.

[BibT_eX]

[DOI]

Július Czap

Discuss. Math. Graph Theory, 2013

Problems on cycles and colorings.

[BibT_eX]

[DOI]

Discret. Math., 2013

Color the cycles.

[BibT_eX]

[DOI]

Gyula O. H. Katona

Discret. Math., 2013

Cordial labeling of hypertrees.

[BibT_eX]

[DOI]

Sylwia Cichacz

Agnieszka Görlich

Discret. Math., 2013

Color-bounded hypergraphs, VI: Structural and functional jumps in complexity.

[BibT_eX]

[DOI]

Discret. Math., 2013

Equality of domination and transversal numbers in hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Bin covering with a general profit function: approximability results.

[BibT_eX]

[DOI]

Attila Benko

Central Eur. J. Oper. Res., 2013

Matching Matchings.

[BibT_eX]

[DOI]

Proceedings of the 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, 2013

2012

List Colorings of K5-Minor-Free Graphs With Special List Assignments.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Small Edge Sets Meeting all Triangles of a Graph.

[BibT_eX]

[DOI]

S. Aparna Lakshmanan

Graphs Comb., 2012

Transversals and domination in uniform hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Vertex coloring without large polychromatic stars.

[BibT_eX]

[DOI]

Discret. Math., 2012

3-consecutive edge coloring of a graph.

[BibT_eX]

[DOI]

Discret. Math., 2012

Proper connection of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Distance domination versus iterated domination.

[BibT_eX]

[DOI]

Discret. Math., 2012

Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms

[BibT_eX]

[DOI]

CoRR, 2012

Black and White Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

2011

Complexity and approximation of the Constrained Forest problem.

[BibT_eX]

[DOI]

Basile Couëtoux

Theor. Comput. Sci., 2011

Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

The Graph-Bin Packing Problem.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Combinatorial batch codes: Extremal problems under Hall-type conditions.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Optimal guard sets and the Helly property.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

Color-bounded hypergraphs, V: host graphs and subdivisions.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2011

Improper C-colorings of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

The most vital nodes with respect to independent set and vertex cover.

[BibT_eX]

[DOI]

Sonia Toubaline

Discret. Appl. Math., 2011

Optimal batch codes: Many items or low retrieval requirement.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2011

Graph based Solution for Segmentation Tasks in Case of Out-of-focus, Noisy and Corrupted Images.

[BibT_eX]

Tamás Szirányi

Proceedings of the IMAGAPP & IVAPP 2011, 2011

2010

Geometric representation for semi on-line scheduling on uniform processors.

[BibT_eX]

[DOI]

József Szoldatics

Optim. Methods Softw., 2010

C-perfect hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Satisfactory graph partition, variants, and generalizations.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

3-consecutive C-colorings of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2010

Hall number for list colorings of graphs: Extremal results.

[BibT_eX]

[DOI]

Discret. Math., 2010

Approximation algorithms for the minimum rainbow subgraph problem.

[BibT_eX]

[DOI]

Stephan Matos Camacho

Ingo Schiermeyer

Discret. Math., 2010

Color-bounded hypergraphs, IV: Stable colorings of hypertrees.

[BibT_eX]

[DOI]

Discret. Math., 2010

Infinite versus finite graph domination.

[BibT_eX]

[DOI]

Heinz A. Jung

Discret. Math., 2010

Voloshin's conjecture for C-perfect hypertrees.

[BibT_eX]

[DOI]

Australas. J Comb., 2010

Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures.

[BibT_eX]

[DOI]

Sonia Toubaline

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Bin Packing/Covering with Delivery, solved with the evolution of algorithms.

[BibT_eX]

[DOI]

Attila Benko

Wenceslas Fernandez de la Vega

Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010

2009

Groupies in random graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Learning of winning strategies for terminal games with linear-size memory.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2009

Smallest Set-Transversals of k-Partitions.

[BibT_eX]

[DOI]

Graphs Comb., 2009

Clique-transversal sets and weak 2-colorings in graphs of small maximum degree.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2009

On list critical graphs.

[BibT_eX]

[DOI]

Michael Stiebitz

Discret. Math., 2009

Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees.

[BibT_eX]

[DOI]

Discret. Math., 2009

Color-bounded hypergraphs, I: General results.

[BibT_eX]

[DOI]

Discret. Math., 2009

Some complexity problems on single input double output controllers.

[BibT_eX]

[DOI]

Katalin M. Hangos

Anders Yeo

Discret. Appl. Math., 2009

Logartihmic upper bound for the upper chromatic number of S(t, t+1, v) systems.

[BibT_eX]

Ars Comb., 2009

Covering a Graph with a Constrained Forest (Extended Abstract).

[BibT_eX]

[DOI]

Basile Couëtoux

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Semi-online scheduling on two uniform processors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

Approximation of satisfactory bisection problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

Uniform Mixed Hypergraphs: The Possible Numbers of Colors.

[BibT_eX]

[DOI]

Graphs Comb., 2008

On Rainbow Connection.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2007

Semi on-line scheduling on three processors with known sum of the tasks.

[BibT_eX]

[DOI]

J. Sched., 2007

Extremal jumps of the Hall number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Characterization of graphs dominated by induced paths.

[BibT_eX]

[DOI]

Discret. Math., 2007

On-line arbitrarily vertex decomposable trees.

[BibT_eX]

[DOI]

Mirko Hornák

Mariusz Wozniak

Discret. Appl. Math., 2007

Orderings of uniquely colorable hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Efficient algorithms for decomposing graphs under degree constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Game List Colouring of Graphs.

[BibT_eX]

[DOI]

Elzbieta Sidorowicz

Electron. J. Comb., 2007

Lower bound on the profile of degree pairs in cross-intersecting set systems.

[BibT_eX]

[DOI]

Zsuzsanna Szaniszló

Comb., 2007

2006

Formal Theory of Connectionist Web Retrieval.

[BibT_eX]

[DOI]

Sándor Dominich

Adrienn Skrop

Proceedings of the Soft Computing in Web Information Retrieval - Models and Applications, 2006

Degree-constrained decompositions of graphs: Bounded treewidth and planarity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Largest Non-Unique Subgraphs.

[BibT_eX]

[DOI]

Lars Døvling Andersen

Preben D. Vestergaard

Graphs Comb., 2006

Mixed colorings of hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2006

The cost chromatic number and hypergraph parameters.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2006

The satisfactory partition problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

List version of L(d, s)-labelings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Highly connected counterexamples to a conjecture on ά -domination.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2005

Graph Domination in Distance Two.

[BibT_eX]

[DOI]

Attila Tálos

Discuss. Math. Graph Theory, 2005

Dominating Bipartite Subgraphs in Graphs.

[BibT_eX]

[DOI]

Danuta Michalak

Discuss. Math. Graph Theory, 2005

The cover pebbling number of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2005

Strong branchwidth and local transversals.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Complexity and Approximation of Satisfactory Partition Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks.

[BibT_eX]

[DOI]

Á. B. Nagy

J. Sched., 2004

Partition of C 4-Designs into Minimum and Maximum Number of P 3-Designs.

[BibT_eX]

[DOI]

Gaetano Quattrocchi

Graphs Comb., 2004

Graphs without induced P5 and C5.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

On short cycles through prescribed vertices of a graph.

[BibT_eX]

[DOI]

Discret. Math., 2004

Scheduling groups of tasks with precedence constraints on three dedicated processors.

[BibT_eX]

[DOI]

Renata Mansini

Discret. Appl. Math., 2004

The effect of model simplification assumptions on the differential index of lumped process models.

[BibT_eX]

[DOI]

Katalin M. Hangos

Gábor Szederkényi

Comput. Chem. Eng., 2004

2003

Marking Games and the Oriented Game Chromatic Number of Partial k-Trees.

[BibT_eX]

[DOI]

Hal A. Kierstead

Graphs Comb., 2003

Strict colorings of Steiner triple and quadruple systems: a survey.

[BibT_eX]

[DOI]

Discret. Math., 2003

Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types.

[BibT_eX]

[DOI]

Comput. Sci. J. Moldova, 2003

Schütte's Tournament Problem and Intersecting Families of Sets.

[BibT_eX]

[DOI]

Jaroslaw Grytczuk

Mariusz Haluszczak

Comb. Probab. Comput., 2003

Local Anti-Ramsey Numbers of Graphs.

[BibT_eX]

[DOI]

Maria Axenovich

Tao Jiang

Comb. Probab. Comput., 2003

Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.

[BibT_eX]

[DOI]

Algorithmica, 2003

Unique colorings of bi-hypergraphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2003

On the Existence and Determination of Satisfactory Partitions in a Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Colorings and Related Topics.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Graph Theory., 2003

2002

Distance Graphs with Finite Chromatic Number.

[BibT_eX]

[DOI]

Imre Z. Ruzsa

J. Comb. Theory B, 2002

On the complexity of bicoloring clique hypergraphs of graphs.

[BibT_eX]

[DOI]

J. Algorithms, 2002

The Chromatic Spectrum of Mixed Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2002

Domination in partitioned graphs.

[BibT_eX]

[DOI]

Preben D. Vestergaard

Discuss. Math. Graph Theory, 2002

Uniquely colorable mixed hypergraphs.

[BibT_eX]

[DOI]

Huishan Zhou

Discret. Math., 2002

A note on planar 5-list colouring: non-extendability at distance 4.

[BibT_eX]

[DOI]

Discret. Math., 2002

Structural domination of graphs.

[BibT_eX]

Ars Comb., 2002

On the b-Chromatic Number of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001

Ramsey numbers for tournaments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Oriented list colorings of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2001

Minimally Non-Preperfect Graphs of Small Maximum Degree.

[BibT_eX]

[DOI]

Annegret K. Wagler

Graphs Comb., 2001

Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

Heredity properties of connectedness in edge-coloured complete graphs.

[BibT_eX]

[DOI]

Adam Idzik

Discret. Math., 2001

Complexity of Coloring Graphs without Forbidden Induced Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

2000

Sharpness of Some Intersection Theorems.

[BibT_eX]

[DOI]

László Spissich

Eur. J. Comb., 2000

Extremal bi-Helly families.

[BibT_eX]

[DOI]

Discret. Math., 2000

On-line rankings of graphs.

[BibT_eX]

[DOI]

Ingo Schiermeyer

Discret. Math., 2000

Uncolorable Mixed Hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

On the complexity of bicoloring clique hypergraphs of graphs (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors.

[BibT_eX]

[DOI]

Parallel Comput., 1999

On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs.

[BibT_eX]

[DOI]

Miklos Santha

J. Algorithms, 1999

Chromatic spectrum is broken.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

Remarks on the existence of uniquely partitionable planar graphs.

[BibT_eX]

[DOI]

Peter Mihók

Discuss. Math. Graph Theory, 1999

Disjoint blocking sets in cycle systems.

[BibT_eX]

[DOI]

Discret. Math., 1999

On light cycles in plane triangulations.

[BibT_eX]

[DOI]

Discret. Math., 1999

Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality.

[BibT_eX]

[DOI]

Stanislaw Bylka

Adam Idzik

Discret. Math., 1999

On-line approximation algorithms for scheduling tasks on identical machines withextendable working time.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1999

1998

Rankings of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

Brooks-type theorems for choosability with separation.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.

[BibT_eX]

[DOI]

Paolo Dell'Olmo

Inf. Process. Lett., 1998

Strict colourings for classes of steiner triple systems.

[BibT_eX]

[DOI]

Discret. Math., 1998

Complexity of choosing subsets from color sets.

[BibT_eX]

[DOI]

Discret. Math., 1998

Rankings of Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Miklos Santha

Proceedings of the STACS 98, 1998

Efficient Approximation Algorithms for the Subset-Sums Equality Problem.

[BibT_eX]

[DOI]

Miklos Santha

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Semi on-line algorithms for the partition problem.

[BibT_eX]

[DOI]

Vladimir Kotov

Oper. Res. Lett., 1997

Graph colorings with local constraints - a survey.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1997

Generalized colorings and avoidable orientations.

[BibT_eX]

[DOI]

Jenö Szigeti

Discuss. Math. Graph Theory, 1997

Upper chromatic number of Steiner triple and quadruple systems.

[BibT_eX]

[DOI]

Discret. Math., 1997

The color cost of a caterpillar.

[BibT_eX]

[DOI]

Frank Harary

Discret. Math., 1997

Efficiency and effectiveness of normal schedules on three dedicated processors.

[BibT_eX]

[DOI]

Paolo Dell'Olmo

Discret. Math., 1997

Choosability and fractional chromatic numbers.

[BibT_eX]

[DOI]

Noga Alon

Discret. Math., 1997

List Colorings and Reducibility.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Comparability Graph Augmentation for some Multiprocessor Scheduling Problems.

[BibT_eX]

[DOI]

Paolo Dell'Olmo

Discret. Appl. Math., 1997

Switching Distance Graphs.

[BibT_eX]

John G. Gimbel

Ars Comb., 1997

New trends in the theory of graph colorings: Choosability and list coloring.

[BibT_eX]

[DOI]

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

Optimal routings in communication networks with linearly bounded forwarding index.

[BibT_eX]

[DOI]

Networks, 1996

Every 2-choosable graph is (2m, m)-choosable.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Cycles of given color patterns.

[BibT_eX]

[DOI]

Michael Spyratos

J. Graph Theory, 1996

Minimal colorings for properly colored subgraphs.

[BibT_eX]

[DOI]

Graphs Comb., 1996

Ramsey-remainder.

[BibT_eX]

[DOI]

Pavel Valtr

Eur. J. Comb., 1996

The irregularity strength and cost of the union of cliques.

[BibT_eX]

[DOI]

Stanislav Jendrol'

Michal Tkác

Discret. Math., 1996

Covering and independence in triangle structures.

[BibT_eX]

[DOI]

Tibor Gallai

Discret. Math., 1996

Hamiltonian properties of Toeplitz graphs.

[BibT_eX]

[DOI]

René van Dal

Gert A. Tijssen

Jack A. A. van der Veen

Christina Zamfirescu

Tudor Zamfirescu

Discret. Math., 1996

Cycle-saturated graphs of minimum size.

[BibT_eX]

[DOI]

Discret. Math., 1996

The Forwarding Index of Directed Networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

Precoloring Extension 3: Classes of Perfect Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

1995

How to Make A Random Graph Irregular.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

The Acyclic Orientation Game on Random Graphs.

[BibT_eX]

[DOI]

Noga Alon

Random Struct. Algorithms, 1995

Degree Sums and Covering Cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

Stronger bounds for generalized degress and Menger path systems.

[BibT_eX]

[DOI]

Ralph J. Faudree

Discuss. Math. Graph Theory, 1995

4-chromatic graphs with large odd girth.

[BibT_eX]

[DOI]

Nguyen Van Ngoc

Discret. Math., 1995

Searching for acyclic orientations of graphs.

[BibT_eX]

[DOI]

Martin Aigner

Eberhard Triesch

Discret. Math., 1995

1994

Bipartite Subgraphs of Triangle-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1994

The expected relative error of the polyhedral approximation of the max-cut problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1994

Local and global average degree in graphs and multigraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1994

Intersection Dimensions of Graph Classes.

[BibT_eX]

[DOI]

Graphs Comb., 1994

Largest size and union of Helly families.

[BibT_eX]

[DOI]

Discret. Math., 1994

Monochromatic coverings and tree Ramsey numbers.

[BibT_eX]

[DOI]

Discret. Math., 1994

Characterization of (m, 1)-transitive and (3, 2)-transitive semi-complete directed graphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

The spectrum of lambda-times repeated blocks for TS(upsilon, lambda).

[BibT_eX]

[DOI]

Discret. Math., 1994

On conjectures of Berge and Chvátal.

[BibT_eX]

[DOI]

Discret. Math., 1994

Inequalities for Minimal Covering Sets in Set Systems of Given Rank.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Algorithmic complexity of list colorings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Packing Problems in Edge-colored Graphs.

[BibT_eX]

[DOI]

Pavol Hell

Discret. Appl. Math., 1994

Blocking Sets in SQS(2u).

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

Ranking of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1993

The Number of Maximal Independent Sets in Triangle-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1993

Algorithmic Aspects of Neighborhood Numbers.

[BibT_eX]

[DOI]

Gerard J. Chang

Martin Farber

SIAM J. Discret. Math., 1993

One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete.

[BibT_eX]

[DOI]

Petr Savický

SIAM J. Comput., 1993

An upper bound on the number of cliques in a graph.

[BibT_eX]

[DOI]

Martin Farber

Networks, 1993

Helly Property in Finite Set Systems.

[BibT_eX]

J. Comb. Theory A, 1993

Multipartite Turán problem for connected graphs and hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

Menger-type theorems with restrictions on path lengths.

[BibT_eX]

[DOI]

László Pyber

Discret. Math., 1993

Large s-representable set systems with low maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 1993

Bounded degrees and prescribed distances in graphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

Graphs with no induced C4 and 2K2.

[BibT_eX]

[DOI]

Discret. Math., 1993

Domination properties and induced subgraphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

Linear-Time Algorithms for the Max Cut Problem.

[BibT_eX]

[DOI]

Nguyen Van Ngoc

Comb. Probab. Comput., 1993

Maximum cuts and largest bipartite subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization, 1993

1992

Rainbow Subgraphs in Properly Edge-colored Graphs.

[BibT_eX]

[DOI]

Vojtech Rödl

Random Struct. Algorithms, 1992

Nearly uniform distribution of edges among k-subgraphs of a graph.

[BibT_eX]

[DOI]

Jozef Sirán

J. Graph Theory, 1992

Graph coloring in linear time.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

Asymptotic growth of sparse saturated structures is locally determined.

[BibT_eX]

[DOI]

Discret. Math., 1992

Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets.

[BibT_eX]

[DOI]

Discret. Math., 1992

Covering the cliques of a graph with vertices.

[BibT_eX]

[DOI]

Tibor Gallai

Discret. Math., 1992

Precoloring extension. I. Interval graphs.

[BibT_eX]

[DOI]

Miklós Biró

Discret. Math., 1992

Narrowness, pathwidth, and their application in natural language processing.

[BibT_eX]

[DOI]

András Kornai

Discret. Appl. Math., 1992

Perfect couples of graphs.

[BibT_eX]

[DOI]

János Körner

Gábor Simonyi

Comb., 1992

1991

A Periodic Division Pattern that Cannot be Generated by D0L Systems.

[BibT_eX]

[DOI]

Martin J. M. de Boer

Aristid Lindenmayer

Theor. Comput. Sci., 1991

Improved lower bounds on k-independence.

[BibT_eX]

[DOI]

J. Graph Theory, 1991

Extensions of Gallai's graph covering theorems for uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Local constraints ensuring small representing sets.

[BibT_eX]

[DOI]

András Hajnal

J. Comb. Theory A, 1991

Hypergraph coverings and local colorings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Perfect graph decompositions.

[BibT_eX]

[DOI]

Graphs Comb., 1991

Asymptotic results on saturated graphs.

[BibT_eX]

[DOI]

Discret. Math., 1991

Decompositions of regular bipartite graphs.

[BibT_eX]

[DOI]

Michael S. Jacobson

Discret. Math., 1991

Saturated r-uniform hypergraphs.

[BibT_eX]

[DOI]

Zoltán Füredi

Discret. Math., 1991

Clique-transversal sets of line graphs and complements of line graphs.

[BibT_eX]

[DOI]

Thomas Andreae

Martin Schughart

Discret. Math., 1991

1990

Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

A characterization of graphs without long induced paths.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

Periodic String Division Generated by Deterministic L Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

A conjecture on triangles of graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1990

Contractions and minimalk-colorability.

[BibT_eX]

[DOI]

Graphs Comb., 1990

Covering all cliques of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1990

The maximum number of edges in 2K2-free graphs of bounded degree.

[BibT_eX]

[DOI]

Discret. Math., 1990

1989

Minimum number of elements representing a set system of given rank.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1989

On the maximum number of qualitatively independent partitions.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1989

Radius, diameter, and minimum degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1989

Sub-Ramsey numbers for arithmetic progressions.

[BibT_eX]

[DOI]

Noga Alon

Graphs Comb., 1989

Induced matchings in bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1989

1988

Isomorphism of two infinite-chromatic triangle-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 1988

Clumsy packing of dominoes.

[BibT_eX]

[DOI]

Discret. Math., 1988

1987

Local k-colorings of graphs and hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

Inequalities for two set systems with prescribed intersections.

[BibT_eX]

[DOI]

Graphs Comb., 1987

Linear upper bounds for local Ramsey numbers.

[BibT_eX]

[DOI]

Graphs Comb., 1987

Maximum bipartite subgraphs of Kneser graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1987

Ramsey numbers for local colorings.

[BibT_eX]

[DOI]

Graphs Comb., 1987

Another Extremal Property of Some Turan Graphs.

[BibT_eX]

[DOI]

Christopher S. Edwards

Peter D. Johnson Jr.

Eur. J. Comb., 1987

An upper bound on the Ramsey number of trees.

[BibT_eX]

[DOI]

Discret. Math., 1987

On two intersecting set systems and k-continuous boolean functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1987

On the context-free production complexity of finite languages.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1987

1986

Saturated graphs with minimal number of edges.

[BibT_eX]

[DOI]

L. Kászonyi

J. Graph Theory, 1986

Neighborhood perfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 1986

Some combinatorial problems concerning finite languages.

[BibT_eX]

[DOI]

Proceedings of the Trends, 1986

1985

Critical hypergraphs and intersecting set-pair systems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1985

On color critical graphs.

[BibT_eX]

[DOI]

Vojtech Rödl

J. Comb. Theory B, 1985

Hypergraphs without a large star.

[BibT_eX]

[DOI]

Zoltán Füredi

Discret. Math., 1985

How many atoms can be defined by boxes.

[BibT_eX]

[DOI]

Comb., 1985

1984

Helly-type Hypergraphs and Sperner Families.

[BibT_eX]

[DOI]

Eur. J. Comb., 1984

The structure of rectangle families dividing the plane into maximum number of atoms.

[BibT_eX]

[DOI]

Discret. Math., 1984

Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices.

[BibT_eX]

[DOI]

Comb., 1984

1982

Triangle-free partial graphs and edge covering theorems.

[BibT_eX]

[DOI]

Discret. Math., 1982

1980

Ensembles d'articulation d'un graphe γ-critique.

[BibT_eX]

[DOI]

Discret. Math., 1980

Induced subtrees in graphs of large chromatic number.

[BibT_eX]

[DOI]

Endre Szemerédi