Zoltán Király

Krisztina Gyorffyné Holló

Comb. Probab. Comput., 2023

2022

Upper bounds for the necklace folding problems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

2021

Application of the ZED Depth Sensor for Painting Robot Vision System Development.

[BibT_eX]

[DOI]

IEEE Access, 2021

Quantitative metrics characterizing malicious samples.

[BibT_eX]

[DOI]

Ferenc Leitold

Proceedings of the International Conference on Cyber Situational Awareness, 2021

2020

Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding.

[BibT_eX]

[DOI]

Alija Pasic

Péter Babarczi

János Tapolcai

Lajos Rónyai

IEEE/ACM Trans. Netw., 2020

2019

Packing tree degree sequences.

[BibT_eX]

[DOI]

Informatica (Slovenia), 2019

2018

Optimal and heuristic network coding algorithms for multi-layered video broadcast.

[BibT_eX]

[DOI]

Networks, 2018

Spanning tree with lower bound on the degrees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Acyclic orientations with degree constraints.

[BibT_eX]

[DOI]

Dömötör Pálvölgyi

CoRR, 2018

Fuzzified Gabor Filter for Text Recognition in Images.

[BibT_eX]

[DOI]

Vladimir Tadic

Zeljen Trpovski

Tatjana Loncar-Turukalo

Péter Odry

Proceedings of the 16th IEEE International Symposium on Intelligent Systems and Informatics, 2018

2017

Covering complete partite hypergraphs by monochromatic components.

[BibT_eX]

[DOI]

Discret. Math., 2017

Network Coding Algorithms for Multi-Layered Video Broadcast.

[BibT_eX]

[DOI]

CoRR, 2017

On Ryser's Conjecture for $t$-Intersecting and Degree-Bounded Hypergraphs.

[BibT_eX]

[DOI]

Lilla Tóthmérész

Electron. J. Comb., 2017

2016

Simpler Approximation for Stable Marriage.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

2015

Randomized and deterministic algorithms for network coding problems in wireless networks.

[BibT_eX]

[DOI]

Erika R. Kovács

Inf. Process. Lett., 2015

On the tractability of some natural packing, covering and partitioning problems.

[BibT_eX]

[DOI]

Attila Bernáth

Discret. Appl. Math., 2015

Survivable routing meets diversity coding.

[BibT_eX]

[DOI]

Alija Pasic

János Tapolcai

Péter Babarczi

Lajos Rónyai

Proceedings of the 14th IFIP Networking Conference, 2015

2014

Notes on dual-critical graphs.

[BibT_eX]

[DOI]

Sándor Kisfaludi-Bak

CoRR, 2014

Shortest Paths in Nearly Conservative Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

On the Swap-Distances of Different Realizations of a Graphical Degree Sequence.

[BibT_eX]

[DOI]

Péter L. Erdös

István Miklós

Comb. Probab. Comput., 2013

Linear Time Local Approximation Algorithm for Maximum Stable Marriage.

[BibT_eX]

[DOI]

Algorithms, 2013

2012

On Families of Weakly Cross-intersecting Set-pairs.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Efficient implementations of minimum-cost flow algorithms

[BibT_eX]

[DOI]

Péter Kovács

CoRR, 2012

Deterministic network coding algorithms and applications for wireless networks.

[BibT_eX]

[DOI]

Erika Renata Kovács

Proceedings of the International Symposium on Network Coding, 2012

2011

Monochromatic components in edge-colored complete uniform hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Better and Simpler Approximation Algorithms for the Stable Marriage Problem.

[BibT_eX]

[DOI]

Algorithmica, 2011

2010

Induced Graph Packing Problems.

[BibT_eX]

[DOI]

Jácint Szabó

Graphs Comb., 2010

Local edge-connectivity augmentation in hypergraphs is NP-complete.

[BibT_eX]

[DOI]

Ben Cosh

Bill Jackson

Discret. Appl. Math., 2010

2008

Recent results on well-balanced orientations.

[BibT_eX]

[DOI]

Discret. Optim., 2008

2007

An algorithm for node-capacitated ring routing.

[BibT_eX]

[DOI]

Balázs Kotnyek

Oper. Res. Lett., 2007

2006

Simultaneous well-balanced orientations of graphs.

[BibT_eX]

[DOI]

Zoltán Szigeti

J. Comb. Theory B, 2006

2005

Generalized Secure Routerless Routing.

[BibT_eX]

[DOI]

Vince Grolmusz

Proceedings of the Networking, 2005

2004

Packing paths of length at least two.

[BibT_eX]

[DOI]

Mikio Kano

Gyula Y. Katona

Discret. Math., 2004

Secure routerless routing.

[BibT_eX]

[DOI]

Vince Grolmusz

Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture, 2004

2003

On the orientation of graphs and hypergraphs.

[BibT_eX]

[DOI]

Tamás Király

Discret. Appl. Math., 2003

2002

Graph Orientations with Edge-connection and Parity Constraints.

[BibT_eX]

[DOI]

Comb., 2002

1999

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs.

[BibT_eX]

[DOI]

Jenö Lehel

SIAM J. Discret. Math., 1999

Parity Constrained <i>k</i>-Edge-Connected Orientations.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis.

[BibT_eX]

[DOI]

András A. Benczúr

Jörg Förster

Proceedings of the Algorithms, 1999

1998

On intersecting hypergraphs.

[BibT_eX]

[DOI]

Barry Guiduli

Discret. Math., 1998

1997

On-line 3-chromatic graphs - II critical graphs.

[BibT_eX]

[DOI]