2025
Covering the edges of a graph with triangles.
Discret. Math., 2025
2024
The Robust Chromatic Number of Graphs.
Graphs Comb., August, 2024
Extremal Graph Theoretic Questions for q-Ary Vectors.
Graphs Comb., May, 2024
Some exact results for regular Turán problems for all large orders.
Eur. J. Comb., March, 2024
Spectrum of 3-uniform 6- and 9-cycle systems over Kv(3)-I.
Discret. Math., March, 2024
Indicated domination game.
Discret. Math., 2024
Extremal behavior of the Greedy algorithm for a triangle scheduling problem.
Comput. Oper. Res., 2024
Connected Turán number of trees.
Ars Math. Contemp., 2024
No Tiling of the 70 × 70 Square with Consecutive Squares.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024
2023
Gregarious Decompositions of Complete Equipartite Graphs and Related Structures.
Symmetry, December, 2023
The board packing problem.
Eur. J. Oper. Res., August, 2023
The bin covering with delivery problem, extended investigations for the online case.
Central Eur. J. Oper. Res., March, 2023
Minimal Non-C-Perfect Hypergraphs with Circular Symmetry.
Symmetry, 2023
Vector sum-intersection theorems.
Discret. Math., 2023
2022
Guillotine cutting is asymptotically optimal for packing consecutive squares.
Optim. Lett., 2022
The k-path vertex cover: General bounds and chordal graphs.
Networks, 2022
Realization of digraphs in Abelian groups and its consequences.
J. Graph Theory, 2022
Strong Edge Coloring of Cayley Graphs and Some Product Graphs.
Graphs Comb., 2022
On saturation of Berge hypergraphs.
Eur. J. Comb., 2022
Singular Turán numbers and WORM-colorings.
Discuss. Math. Graph Theory, 2022
Saturation problems with regularity constraints.
Discret. Math., 2022
2021
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time.
Theor. Comput. Sci., 2021
Coloring Properties of Mixed Cycloids.
Symmetry, 2021
The domination number of the graph defined by two levels of the n-cube, II.
Eur. J. Comb., 2021
<i>Z<sub>2</sub>× Z<sub>2</sub></i>-cordial cycle-free hypergraphs.
Discuss. Math. Graph Theory, 2021
On Grundy total domination number in product graphs.
Discuss. Math. Graph Theory, 2021
Comparison of sum choice number with chromatic sum.
Discret. Math., 2021
Complex uniformly resolvable decompositions of K_v.
Ars Math. Contemp., 2021
2020
On caterpillar factors in graphs.
Theor. Comput. Sci., 2020
On Specific Factors in Graphs.
Graphs Comb., 2020
Clique coverings and claw-free graphs.
Eur. J. Comb., 2020
Independent (k+1)-domination in k-trees.
Discret. Appl. Math., 2020
2019
Restricted assignment scheduling with resource constraints.
Theor. Comput. Sci., 2019
Finding a potential community in networks.
Theor. Comput. Sci., 2019
Disjoint Paired-Dominating sets in Cubic Graphs.
Graphs Comb., 2019
Using weight decision for decreasing the price of anarchy in selfish bin packing games.
Eur. J. Oper. Res., 2019
Domination game on uniform hypergraphs.
Discret. Appl. Math., 2019
Aspects of upper defensive alliances.
Discret. Appl. Math., 2019
The domination number of the graph defined by two levels of the n-cube.
Discret. Appl. Math., 2019
Fractional Domination Game.
Electron. J. Comb., 2019
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum.
Central Eur. J. Oper. Res., 2019
Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs.
Algorithmica, 2019
2018
Safe sets, network majority on weighted trees.
Networks, 2018
Tropical dominating sets in vertex-coloured graphs.
J. Discrete Algorithms, 2018
Safe sets in graphs: Graph classes and structural parameters.
,
,
,
,
,
,
,
,
,
,
,
,
J. Comb. Optim., 2018
A note on the polytope of bipartite TSP.
Discret. Appl. Math., 2018
Multiprofessor scheduling.
Discret. Appl. Math., 2018
Subexponential-time Algorithms for Maximum Independent Set in P<sub>t</sub>-free and Broom-free Graphs.
CoRR, 2018
Tight upper bounds for semi-online scheduling on two uniform machines with known optimum.
Central Eur. J. Oper. Res., 2018
A General Bin Packing Game: Interest Taken into Account.
Algorithmica, 2018
Mixed hypergraphs and beyond.
Art Discret. Appl. Math., 2018
Partition-Crossing Hypergraphs.
Acta Cybern., 2018
Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018
2017
Electron. Notes Discret. Math., 2017
Tropical matchings in vertex-colored graphs.
Electron. Notes Discret. Math., 2017
Bounds on the game transversal number in hypergraphs.
Eur. J. Comb., 2017
The minimum number of vertices in uniform hypergraphs with given domination number.
Discret. Math., 2017
Coloring the cliques of line graphs.
Discret. Math., 2017
Grundy dominating sequences and zero forcing sets.
Discret. Optim., 2017
A combinatorial problem related to sparse systems of equations.
Des. Codes Cryptogr., 2017
F-WORM colorings: Results for 2-connected graphs.
Discret. Appl. Math., 2017
On the Complexity of Finding a Potential Community.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
2016
New models of graph-bin packing.
Theor. Comput. Sci., 2016
Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game.
SIAM J. Discret. Math., 2016
Network Majority on Tree Topological Network.
Electron. Notes Discret. Math., 2016
<i>K<sub>3</sub></i>-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum.
Discuss. Math. Graph Theory, 2016
Some properties of vertex-oblique graphs.
Discret. Math., 2016
The Disjoint Domination Game.
Discret. Math., 2016
Induced cycles in triangle graphs.
Discret. Appl. Math., 2016
Computing all possible graph structures describing linearly conjugate realizations of kinetic systems.
Comput. Phys. Commun., 2016
Dominating Sequences in Grid-Like and Toroidal Graphs.
Electron. J. Comb., 2016
When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence.
Ars Comb., 2016
Tropical Dominating Sets in Vertex-Coloured Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016
H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016
Safe Sets in Graphs: Graph Classes and Structural Parameters.
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the Combinatorial Optimization and Applications, 2016
2015
Offline black and white bin packing.
Theor. Comput. Sci., 2015
Online Results for Black and White Bin Packing.
Theory Comput. Syst., 2015
Induced Decompositions of Highly Dense Graphs.
J. Graph Theory, 2015
Orientations of Graphs with Prescribed Weighted Out-Degrees.
Graphs Comb., 2015
An application of Combinatorics in Cryptography.
Electron. Notes Discret. Math., 2015
Maximum uniformly resolvable decompositions of <sub>K</sub><sub>v</sub> and <sub>K</sub><sub>v</sub>-I into 3-stars and 3-cycles.
Discret. Math., 2015
Distance-constrained labeling of complete trees.
Discret. Math., 2015
Approximability of the upper chromatic number of hypergraphs.
Discret. Math., 2015
Minimum order of graphs with given coloring parameters.
Discret. Math., 2015
Speeding up deciphering by hypergraph ordering.
Des. Codes Cryptogr., 2015
Minimum number of affine simplices of given dimension.
Discret. Appl. Math., 2015
Turán numbers and batch codes.
Discret. Appl. Math., 2015
Generalized Line Graphs: Cartesian Products and Complexity of Recognition.
Electron. J. Comb., 2015
Maximum number of colors in hypertrees of bounded degree.
Central Eur. J. Oper. Res., 2015
Circular coloring of graphs via linear programming and tabu search.
Central Eur. J. Oper. Res., 2015
Bin Packing Game with an Interest Matrix.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015
2014
Complexity and approximation for Traveling Salesman Problems with profits.
Theor. Comput. Sci., 2014
Uniformly resolvable decompositions of K<sub>v</sub> into P<sub>3</sub> and K<sub>3</sub> graphs.
Discret. Math., 2014
Total Transversals and Total Domination in Uniform Hypergraphs.
Electron. J. Comb., 2014
G-designs without blocking sets, Note.
Ars Comb., 2014
2013
Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9.
Theor. Comput. Sci., 2013
Dense subgraph mining with a mixed graph model.
Pattern Recognit. Lett., 2013
Colorability of mixed hypergraphs and their chromatic inversions.
J. Comb. Optim., 2013
Bin packing with "Largest In Bottom" constraint: tighter bounds and generalizations.
J. Comb. Optim., 2013
$$[1, 1, t]$$ -Colorings of Complete Graphs.
Graphs Comb., 2013
Discuss. Math. Graph Theory, 2013
Decompositions of plane graphs under parity constrains given by faces.
Discuss. Math. Graph Theory, 2013
Problems on cycles and colorings.
Discret. Math., 2013
Cordial labeling of hypertrees.
Discret. Math., 2013
Color-bounded hypergraphs, VI: Structural and functional jumps in complexity.
Discret. Math., 2013
Equality of domination and transversal numbers in hypergraphs.
Discret. Appl. Math., 2013
Bin covering with a general profit function: approximability results.
Central Eur. J. Oper. Res., 2013
Proceedings of the 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, 2013
2012
List Colorings of <i>K</i>5-Minor-Free Graphs With Special List Assignments.
J. Graph Theory, 2012
Small Edge Sets Meeting all Triangles of a Graph.
Graphs Comb., 2012
Transversals and domination in uniform hypergraphs.
Eur. J. Comb., 2012
Vertex coloring without large polychromatic stars.
Discret. Math., 2012
3-consecutive edge coloring of a graph.
Discret. Math., 2012
Proper connection of graphs.
Discret. Math., 2012
Distance domination versus iterated domination.
Discret. Math., 2012
Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms
CoRR, 2012
Black and White Bin Packing.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012
2011
Complexity and approximation of the Constrained Forest problem.
Theor. Comput. Sci., 2011
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on-line scheduling.
J. Comb. Optim., 2011
The Graph-Bin Packing Problem.
Int. J. Found. Comput. Sci., 2011
Combinatorial batch codes: Extremal problems under Hall-type conditions.
Electron. Notes Discret. Math., 2011
Optimal guard sets and the Helly property.
Eur. J. Comb., 2011
Color-bounded hypergraphs, V: host graphs and subdivisions.
Discuss. Math. Graph Theory, 2011
Improper C-colorings of graphs.
Discret. Appl. Math., 2011
The most vital nodes with respect to independent set and vertex cover.
Discret. Appl. Math., 2011
Optimal batch codes: Many items or low retrieval requirement.
Adv. Math. Commun., 2011
Graph based Solution for Segmentation Tasks in Case of Out-of-focus, Noisy and Corrupted Images.
Proceedings of the IMAGAPP & IVAPP 2011, 2011
2010
Geometric representation for semi on-line scheduling on uniform processors.
Optim. Methods Softw., 2010
Satisfactory graph partition, variants, and generalizations.
Eur. J. Oper. Res., 2010
3-consecutive C-colorings of graphs.
Discuss. Math. Graph Theory, 2010
Hall number for list colorings of graphs: Extremal results.
Discret. Math., 2010
Approximation algorithms for the minimum rainbow subgraph problem.
Discret. Math., 2010
Color-bounded hypergraphs, IV: Stable colorings of hypertrees.
Discret. Math., 2010
Infinite versus finite graph domination.
Discret. Math., 2010
Voloshin's conjecture for C-perfect hypertrees.
Australas. J Comb., 2010
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010
Bin Packing/Covering with Delivery, solved with the evolution of algorithms.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010
2009
Groupies in random graphs.
Inf. Process. Lett., 2009
Learning of winning strategies for terminal games with linear-size memory.
Int. J. Game Theory, 2009
Smallest Set-Transversals of <i>k</i>-Partitions.
Graphs Comb., 2009
Clique-transversal sets and weak 2-colorings in graphs of small maximum degree.
Discret. Math. Theor. Comput. Sci., 2009
Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees.
Discret. Math., 2009
Color-bounded hypergraphs, I: General results.
Discret. Math., 2009
Some complexity problems on single input double output controllers.
Discret. Appl. Math., 2009
Logartihmic upper bound for the upper chromatic number of S(t, t+1, v) systems.
Ars Comb., 2009
Covering a Graph with a Constrained Forest (Extended Abstract).
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2008
Semi-online scheduling on two uniform processors.
Theor. Comput. Sci., 2008
Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs.
SIAM J. Discret. Math., 2008
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3.
J. Discrete Algorithms, 2008
Approximation of satisfactory bisection problems.
J. Comput. Syst. Sci., 2008
Uniform Mixed Hypergraphs: The Possible Numbers of Colors.
Graphs Comb., 2008
2007
Semi on-line scheduling on three processors with known sum of the tasks.
J. Sched., 2007
Extremal jumps of the Hall number.
Electron. Notes Discret. Math., 2007
Characterization of graphs dominated by induced paths.
Discret. Math., 2007
On-line arbitrarily vertex decomposable trees.
Discret. Appl. Math., 2007
Orderings of uniquely colorable hypergraphs.
Discret. Appl. Math., 2007
Efficient algorithms for decomposing graphs under degree constraints.
Discret. Appl. Math., 2007
Game List Colouring of Graphs.
Electron. J. Comb., 2007
Lower bound on the profile of degree pairs in cross-intersecting set systems.
Comb., 2007
2006
Formal Theory of Connectionist Web Retrieval.
Proceedings of the Soft Computing in Web Information Retrieval - Models and Applications, 2006
Degree-constrained decompositions of graphs: Bounded treewidth and planarity.
Theor. Comput. Sci., 2006
Largest Non-Unique Subgraphs.
Graphs Comb., 2006
Mixed colorings of hypergraphs.
Electron. Notes Discret. Math., 2006
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks.
Discret. Math. Theor. Comput. Sci., 2006
The cost chromatic number and hypergraph parameters.
Discuss. Math. Graph Theory, 2006
The satisfactory partition problem.
Discret. Appl. Math., 2006
2005
List version of <i>L</i>(<i>d</i>, <i>s</i>)-labelings.
Theor. Comput. Sci., 2005
Highly connected counterexamples to a conjecture on <i>ά</i> -domination.
Discuss. Math. Graph Theory, 2005
Graph Domination in Distance Two.
Discuss. Math. Graph Theory, 2005
Dominating Bipartite Subgraphs in Graphs.
Discuss. Math. Graph Theory, 2005
The cover pebbling number of graphs.
Discret. Math., 2005
Strong branchwidth and local transversals.
Discret. Appl. Math., 2005
Complexity and Approximation of Satisfactory Partition Problems.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
2004
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks.
J. Sched., 2004
Partition of <i>C</i> <sub>4</sub>-Designs into Minimum and Maximum Number of <i>P</i> <sub>3</sub>-Designs.
Graphs Comb., 2004
Graphs without induced <i>P<sub>5</sub></i> and <i> C<sub>5</sub></i>.
Discuss. Math. Graph Theory, 2004
On short cycles through prescribed vertices of a graph.
Discret. Math., 2004
Scheduling groups of tasks with precedence constraints on three dedicated processors.
Discret. Appl. Math., 2004
The effect of model simplification assumptions on the differential index of lumped process models.
Comput. Chem. Eng., 2004
2003
Marking Games and the Oriented Game Chromatic Number of Partial k-Trees.
Graphs Comb., 2003
Strict colorings of Steiner triple and quadruple systems: a survey.
Discret. Math., 2003
Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types.
Comput. Sci. J. Moldova, 2003
Schütte's Tournament Problem and Intersecting Families of Sets.
Comb. Probab. Comput., 2003
Local Anti-Ramsey Numbers of Graphs.
Comb. Probab. Comput., 2003
Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.
Algorithmica, 2003
Unique colorings of bi-hypergraphs.
Australas. J Comb., 2003
On the Existence and Determination of Satisfactory Partitions in a Graph.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
Colorings and Related Topics.
Proceedings of the Handbook of Graph Theory., 2003
2002
Distance Graphs with Finite Chromatic Number.
J. Comb. Theory B, 2002
Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem.
J. Comput. Syst. Sci., 2002
On the complexity of bicoloring clique hypergraphs of graphs.
J. Algorithms, 2002
The Chromatic Spectrum of Mixed Hypergraphs.
Graphs Comb., 2002
Domination in partitioned graphs.
Discuss. Math. Graph Theory, 2002
Uniquely colorable mixed hypergraphs.
Discret. Math., 2002
A note on planar 5-list colouring: non-extendability at distance 4.
Discret. Math., 2002
Structural domination of graphs.
Ars Comb., 2002
On the b-Chromatic Number of Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
2001
Ramsey numbers for tournaments.
Theor. Comput. Sci., 2001
Oriented list colorings of graphs.
J. Graph Theory, 2001
Minimally Non-Preperfect Graphs of Small Maximum Degree.
Graphs Comb., 2001
Capelli polynomials, almost-permutation matrices and sparse Eulerian graphs.
Discret. Math., 2001
Heredity properties of connectedness in edge-coloured complete graphs.
Discret. Math., 2001
Complexity of Coloring Graphs without Forbidden Induced Subgraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001
2000
Sharpness of Some Intersection Theorems.
Eur. J. Comb., 2000
Extremal bi-Helly families.
Discret. Math., 2000
On-line rankings of graphs.
Discret. Math., 2000
Uncolorable Mixed Hypergraphs.
Discret. Appl. Math., 2000
On the complexity of bicoloring clique hypergraphs of graphs (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
1999
Rankings of Directed Graphs.
SIAM J. Discret. Math., 1999
A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors.
Parallel Comput., 1999
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs.
J. Algorithms, 1999
Chromatic spectrum is broken.
Electron. Notes Discret. Math., 1999
Remarks on the existence of uniquely partitionable planar graphs.
Discuss. Math. Graph Theory, 1999
Disjoint blocking sets in cycle systems.
Discret. Math., 1999
On light cycles in plane triangulations.
Discret. Math., 1999
Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality.
Discret. Math., 1999
On-line approximation algorithms for scheduling tasks on identical machines withextendable working time.
Ann. Oper. Res., 1999
1998
SIAM J. Discret. Math., 1998
Brooks-type theorems for choosability with separation.
J. Graph Theory, 1998
A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.
Inf. Process. Lett., 1998
Strict colourings for classes of steiner triple systems.
Discret. Math., 1998
Complexity of choosing subsets from color sets.
Discret. Math., 1998
On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract).
Proceedings of the STACS 98, 1998
1997
Semi on-line algorithms for the partition problem.
Oper. Res. Lett., 1997
Graph colorings with local constraints - a survey.
Discuss. Math. Graph Theory, 1997
Generalized colorings and avoidable orientations.
Discuss. Math. Graph Theory, 1997
Upper chromatic number of Steiner triple and quadruple systems.
Discret. Math., 1997
The color cost of a caterpillar.
Discret. Math., 1997
Efficiency and effectiveness of normal schedules on three dedicated processors.
Discret. Math., 1997
Choosability and fractional chromatic numbers.
Discret. Math., 1997
List Colorings and Reducibility.
Discret. Appl. Math., 1997
Comparability Graph Augmentation for some Multiprocessor Scheduling Problems.
Discret. Appl. Math., 1997
Switching Distance Graphs.
Ars Comb., 1997
New trends in the theory of graph colorings: Choosability and list coloring.
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.
Networks, 1996
Every 2-choosable graph is (2<i>m, m</i>)-choosable.
J. Graph Theory, 1996
Cycles of given color patterns.
J. Graph Theory, 1996
Minimal colorings for properly colored subgraphs.
Graphs Comb., 1996
The irregularity strength and cost of the union of cliques.
Discret. Math., 1996
Covering and independence in triangle structures.
Discret. Math., 1996
Hamiltonian properties of Toeplitz graphs.
Discret. Math., 1996
Cycle-saturated graphs of minimum size.
Discret. Math., 1996
The Forwarding Index of Directed Networks.
Discret. Appl. Math., 1996
Precoloring Extension 3: Classes of Perfect Graphs.
Comb. Probab. Comput., 1996
1995
How to Make A Random Graph Irregular.
Random Struct. Algorithms, 1995
The Acyclic Orientation Game on Random Graphs.
Random Struct. Algorithms, 1995
Degree Sums and Covering Cycles.
J. Graph Theory, 1995
Stronger bounds for generalized degress and Menger path systems.
Discuss. Math. Graph Theory, 1995
4-chromatic graphs with large odd girth.
Discret. Math., 1995
Searching for acyclic orientations of graphs.
Discret. Math., 1995
1994
Bipartite Subgraphs of Triangle-Free Graphs.
SIAM J. Discret. Math., 1994
The expected relative error of the polyhedral approximation of the max-cut problem.
Oper. Res. Lett., 1994
Local and global average degree in graphs and multigraphs.
J. Graph Theory, 1994
Intersection Dimensions of Graph Classes.
Graphs Comb., 1994
Largest size and union of Helly families.
Discret. Math., 1994
Monochromatic coverings and tree Ramsey numbers.
Discret. Math., 1994
Characterization of (m, 1)-transitive and (3, 2)-transitive semi-complete directed graphs.
Discret. Math., 1994
The spectrum of lambda-times repeated blocks for TS(upsilon, lambda).
Discret. Math., 1994
On conjectures of Berge and Chvátal.
Discret. Math., 1994
Inequalities for Minimal Covering Sets in Set Systems of Given Rank.
Discret. Appl. Math., 1994
Algorithmic complexity of list colorings.
Discret. Appl. Math., 1994
Packing Problems in Edge-colored Graphs.
Discret. Appl. Math., 1994
Blocking Sets in SQS(2u).
Comb. Probab. Comput., 1994
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994
1993
The Number of Maximal Independent Sets in Triangle-Free Graphs.
SIAM J. Discret. Math., 1993
Algorithmic Aspects of Neighborhood Numbers.
SIAM J. Discret. Math., 1993
One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete.
SIAM J. Comput., 1993
An upper bound on the number of cliques in a graph.
Networks, 1993
Helly Property in Finite Set Systems.
J. Comb. Theory A, 1993
Multipartite Turán problem for connected graphs and hypergraphs.
Discret. Math., 1993
Menger-type theorems with restrictions on path lengths.
Discret. Math., 1993
Large s-representable set systems with low maximum degree.
Discret. Math., 1993
Bounded degrees and prescribed distances in graphs.
Discret. Math., 1993
Graphs with no induced C<sub>4</sub> and 2K<sub>2</sub>.
Discret. Math., 1993
Domination properties and induced subgraphs.
Discret. Math., 1993
Linear-Time Algorithms for the Max Cut Problem.
Comb. Probab. Comput., 1993
Maximum cuts and largest bipartite subgraphs.
Proceedings of the Combinatorial Optimization, 1993
1992
Rainbow Subgraphs in Properly Edge-colored Graphs.
Random Struct. Algorithms, 1992
Nearly uniform distribution of edges among <i>k</i>-subgraphs of a graph.
J. Graph Theory, 1992
Graph coloring in linear time.
J. Comb. Theory B, 1992
Asymptotic growth of sparse saturated structures is locally determined.
Discret. Math., 1992
Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets.
Discret. Math., 1992
Covering the cliques of a graph with vertices.
Discret. Math., 1992
Precoloring extension. I. Interval graphs.
Discret. Math., 1992
Narrowness, pathwidth, and their application in natural language processing.
Discret. Appl. Math., 1992
Perfect couples of graphs.
Comb., 1992
1991
A Periodic Division Pattern that Cannot be Generated by D0L Systems.
Theor. Comput. Sci., 1991
Improved lower bounds on <i>k</i>-independence.
J. Graph Theory, 1991
Extensions of Gallai's graph covering theorems for uniform hypergraphs.
J. Comb. Theory B, 1991
Local constraints ensuring small representing sets.
J. Comb. Theory A, 1991
Hypergraph coverings and local colorings.
J. Comb. Theory B, 1991
Perfect graph decompositions.
Graphs Comb., 1991
Asymptotic results on saturated graphs.
Discret. Math., 1991
Decompositions of regular bipartite graphs.
Discret. Math., 1991
Saturated r-uniform hypergraphs.
Discret. Math., 1991
Clique-transversal sets of line graphs and complements of line graphs.
Discret. Math., 1991
1990
Polynomial Algorithms for Finding Cycles and Paths in Bipartite Tournaments.
SIAM J. Discret. Math., 1990
A characterization of graphs without long induced paths.
J. Graph Theory, 1990
Periodic String Division Generated by Deterministic L Systems.
Inf. Process. Lett., 1990
A conjecture on triangles of graphs.
Graphs Comb., 1990
Contractions and minimal<i>k</i>-colorability.
Graphs Comb., 1990
Covering all cliques of a graph.
Discret. Math., 1990
The maximum number of edges in 2K<sub>2</sub>-free graphs of bounded degree.
Discret. Math., 1990
1989
Minimum number of elements representing a set system of given rank.
J. Comb. Theory A, 1989
On the maximum number of qualitatively independent partitions.
J. Comb. Theory A, 1989
Radius, diameter, and minimum degree.
J. Comb. Theory B, 1989
Sub-Ramsey numbers for arithmetic progressions.
Graphs Comb., 1989
Induced matchings in bipartite graphs.
Discret. Math., 1989
1988
Isomorphism of two infinite-chromatic triangle-free graphs.
Discret. Math., 1988
Clumsy packing of dominoes.
Discret. Math., 1988
1987
Local <i>k</i>-colorings of graphs and hypergraphs.
J. Comb. Theory B, 1987
Inequalities for two set systems with prescribed intersections.
Graphs Comb., 1987
Linear upper bounds for local Ramsey numbers.
Graphs Comb., 1987
Maximum bipartite subgraphs of Kneser graphs.
Graphs Comb., 1987
Ramsey numbers for local colorings.
Graphs Comb., 1987
Another Extremal Property of Some Turan Graphs.
Eur. J. Comb., 1987
An upper bound on the Ramsey number of trees.
Discret. Math., 1987
On two intersecting set systems and k-continuous boolean functions.
Discret. Appl. Math., 1987
On the context-free production complexity of finite languages.
Discret. Appl. Math., 1987
1986
Saturated graphs with minimal number of edges.
J. Graph Theory, 1986
Neighborhood perfect graphs.
Discret. Math., 1986
Some combinatorial problems concerning finite languages.
Proceedings of the Trends, 1986
1985
Critical hypergraphs and intersecting set-pair systems.
J. Comb. Theory B, 1985
On color critical graphs.
J. Comb. Theory B, 1985
Hypergraphs without a large star.
Discret. Math., 1985
How many atoms can be defined by boxes.
Comb., 1985
1984
Helly-type Hypergraphs and Sperner Families.
Eur. J. Comb., 1984
The structure of rectangle families dividing the plane into maximum number of atoms.
Discret. Math., 1984
Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices.
Comb., 1984
1982
Triangle-free partial graphs and edge covering theorems.
Discret. Math., 1982
1980
Ensembles d'articulation d'un graphe γ-critique.
Discret. Math., 1980
Induced subtrees in graphs of large chromatic number.
Discret. Math., 1980
