Csaba Biró

According to our database, Csaba Biró authored at least 27 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Dimension Bounds on Classes of Interval Orders with Restricted Representation.

Csaba Biró, Sida Wan

Graphs Comb., December, 2024

2023

Improved lower bound on the on-line chain partitioning of semi-orders with representation.

Csaba Biró, Israel R. Curbelo

Discret. Math., December, 2023

Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph.

Csaba Biró, Jeno Lehel, Géza Tóth

Order, October, 2023

Improved Lower Bounds on the On-line Chain Partitioning of Posets of Bounded Dimension.

Csaba Biró, Israel R. Curbelo

Order, October, 2023

2022

Ramsey properties of products of chains.

Csaba Biró, Sida Wan

Australas. J Comb., 2022

2021

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

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

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

Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs.

Gábor Kusper, Tamás Balla, Csaba Biró, Tibor Tajti, Zijian Gyozo Yang, Imre Baják

Proceedings of the 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2020

Investigation of the Efficiency of Conversion of Directed Graphs to 3-SAT Problems.

Gábor Kusper, Csaba Biró, Tamás Balla

Proceedings of the 14th IEEE International Symposium on Applied Computational Intelligence and Informatics, 2020

The BWConverter Toolchain: An Incomplete Way to Convert SAT Problems into Directed Graphs.

Tamás Balla, Csaba Biró, Gábor Kusper

Proceedings of the 11th International Conference on Applied Informatics (ICAI 2020), 2020

2019

Formal Methods for Modelling Wireless Sensor Networks

Csaba Biró

PhD thesis, 2019

2018

Fine-grained complexity of coloring unit disks and balls.

Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski

J. Comput. Geom., 2018

2017

Generating Optimal Scheduling for Wireless Sensor Networks by Using Optimization Modulo Theories Solvers.

Gergely Kovásznai, Csaba Biró, Balazs Erdelyi

Proceedings of the 15th International Workshop on Satisfiability Modulo Theories affiliated with the International Conference on Computer-Aided Verification (CAV 2017), Heidelberg, Germany, July 22, 2017

2016

Posets with Cover Graph of Pathwidth two have Bounded Dimension.

Csaba Biró, Mitchel T. Keller, Stephen J. Young

Order, 2016

Forcing Posets with Large Dimension to Contain Large Standard Examples.

Csaba Biró, Peter Hamburger, Attila Pór, William T. Trotter

Graphs Comb., 2016

An upper bound on the extremal version of Hajnal's triangle-free game.

Csaba Biró, Paul Horn, D. Jacob Wildstrom

Discret. Appl. Math., 2016

2015

Standard Examples as Subposets of Posets.

Csaba Biró, Peter Hamburger, Attila Pór

Order, 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

Solving SAT by an Iterative Version of the Inclusion-Exclusion Principle.

Gábor Kusper, Csaba Biró

Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2015

2014

The Proof of the Removable Pair Conjecture for Fractional Dimension.

Csaba Biró, Peter Hamburger, Attila Pór

Electron. J. Comb., 2014

2013

Large Chromatic Number and Ramsey Graphs.

Csaba Biró, Zoltán Füredi, Sogol Jahanbekam

Graphs Comb., 2013

How to generate weakly nondecisive SAT instances.

Csaba Biró, Gábor Kusper, Tibor Tajti

Proceedings of the IEEE 11th International Symposium on Intelligent Systems and Informatics, 2013

2011

A combinatorial approach to height sequences in finite partially ordered sets.

Csaba Biró, William T. Trotter

Discret. Math., 2011

2010

Interval partitions and Stanley depth.

Csaba Biró, David M. Howard, Mitchel T. Keller, William T. Trotter, Stephen J. Young

J. Comb. Theory A, 2010

Segment Orders.

Csaba Biró, William T. Trotter

Discret. Comput. Geom., 2010

2009

The First Three Levels of an Order Preserving Hamiltonian Path in the Subset Lattice.

Csaba Biró, David M. Howard

Order, 2009