Problems and results in partially ordered sets, graphs and geometry. - Csaba Biró (2008)

The First Three Levels of an Order Preserving Hamiltonian Path in the Subset Lattice. - Csaba Biró; David M. Howard 002 (Order, 2009)

Segment Orders. - Csaba Biró; William T. Trotter (Discret. Comput. Geom., 2010)

Interval partitions and Stanley depth. - Csaba Biró; David M. Howard 002; Mitchel T. Keller; William T. Trotter; Stephen J. Young (J. Comb. Theory A, 2010)

A combinatorial approach to height sequences in finite partially ordered sets. - Csaba Biró; William T. Trotter (Discret. Math., 2011)

How to generate weakly nondecisive SAT instances. - Csaba Biró; Gábor Kusper; Tibor Tajti (SISY, 2013)

Large Chromatic Number and Ramsey Graphs. - Csaba Biró; Zoltán Füredi; Sogol Jahanbekam (Graphs Comb., 2013)

The Proof of the Removable Pair Conjecture for Fractional Dimension. - Csaba Biró; Peter Hamburger; Attila Pór (Electron. J. Comb., 2014)

Solving SAT by an Iterative Version of the Inclusion-Exclusion Principle. - Gábor Kusper; Csaba Biró (SYNASC, 2015)

The rate of growth of the minimum clique size of graphs of given order and chromatic number. - Csaba Biró; Kris Wease (Discret. Math., 2015)

Standard Examples as Subposets of Posets. - Csaba Biró; Peter Hamburger; Attila Pór (Order, 2015)

An upper bound on the extremal version of Hajnal's triangle-free game. - Csaba Biró; Paul Horn; D. Jacob Wildstrom (Discret. Appl. Math., 2016)

Forcing Posets with Large Dimension to Contain Large Standard Examples. - Csaba Biró; Peter Hamburger; Attila Pór; William T. Trotter (Graphs Comb., 2016)

Posets with Cover Graph of Pathwidth two have Bounded Dimension. - Csaba Biró; Mitchel T. Keller; Stephen J. Young (Order, 2016)

Generating Optimal Scheduling for Wireless Sensor Networks by Using Optimization Modulo Theories Solvers. - Gergely Kovásznai; Csaba Biró; Balazs Erdelyi (SMT, 2017)

Fine-grained complexity of coloring unit disks and balls. - Csaba Biró; Édouard Bonnet; Dániel Marx; Tillmann Miltzow; Pawel Rzazewski (J. Comput. Geom., 2018)

Formal Methods for Modelling Wireless Sensor Networks - Csaba Biró (2019)

The BWConverter Toolchain: An Incomplete Way to Convert SAT Problems into Directed Graphs. - Tamás Balla; Csaba Biró; Gábor Kusper (ICAI, 2020)

Investigation of the Efficiency of Conversion of Directed Graphs to 3-SAT Problems. - Gábor Kusper; Csaba Biró; Tamás Balla (SACI, 2020)

Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs. - Gábor Kusper; Tamás Balla; Csaba Biró; Tibor Tajti; Zijian Gyozo Yang; Imre Baják (SYNASC, 2020)

Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model. - Gábor Kusper; Csaba Biró (Algorithms, 2020)

Accurate Non-Disturbance Population Survey Method of Nesting Colonies in the Reedbed with Georeferenced Aerial Imagery. - Gábor Bakó; Zsolt Molnár; Zsófia Szilágyi; Csaba Biró; Edina Morvai; Örs Ábrám; András Molnár (Sensors, 2020)

Planar Posets that are Accessible from Below Have Dimension at Most 6. - Csaba Biró; Bartlomiej Bosek; Heather C. Smith; William T. Trotter; Ruidong Wang; Stephen J. Young (Order, 2021)

Ramsey properties of products of chains. - Csaba Biró; Sida Wan (Australas. J Comb., 2022)

Improved Lower Bounds on the On-line Chain Partitioning of Posets of Bounded Dimension. - Csaba Biró; Israel R. Curbelo (Order, 2023)

Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph. - Csaba Biró; Jeno Lehel; Géza Tóth 001 (Order, 2023)

Improved lower bound on the on-line chain partitioning of semi-orders with representation. - Csaba Biró; Israel R. Curbelo (Discret. Math., 2023)

Dimension Bounds on Classes of Interval Orders with Restricted Representation. - Csaba Biró; Sida Wan (Graphs Comb., 2024)

Structural Sensitivity in Graphs: An Entropy-Based $k$-Hop Metric and its Applications. - Csaba Biró (SACI, 2025)

Properties of Horizontal Pod Autoscaling Algorithms and Application for Scaling Cloud-Native Network Functions. - Tien Van Do 001; Nam H. Do; Csaba Rotter; T. V. Lakshman; Csaba Biró; Tamás Bérczes (IEEE Trans. Netw. Serv. Manag., 2025)