Csaba Biró

Orcid: 0000-0001-8561-9141

According to our database1, Csaba Biró authored at least 26 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Improved lower bound on the on-line chain partitioning of semi-orders with representation.
Discret. Math., December, 2023

Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph.
Order, October, 2023

Improved Lower Bounds on the On-line Chain Partitioning of Posets of Bounded Dimension.
Order, October, 2023

2022
Ramsey properties of products of chains.
Australas. J Comb., 2022

2021
Planar Posets that are Accessible from Below Have Dimension at Most 6.
Order, 2021

2020
Accurate Non-Disturbance Population Survey Method of Nesting Colonies in the Reedbed with Georeferenced Aerial Imagery.
Sensors, 2020

Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model.
Algorithms, 2020

Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs.
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.
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.
Proceedings of the 11th International Conference on Applied Informatics (ICAI 2020), 2020

2019
Formal Methods for Modelling Wireless Sensor Networks
PhD thesis, 2019

2018
Fine-grained complexity of coloring unit disks and balls.
J. Comput. Geom., 2018

2017
Generating Optimal Scheduling for Wireless Sensor Networks by Using Optimization Modulo Theories Solvers.
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.
Order, 2016

Forcing Posets with Large Dimension to Contain Large Standard Examples.
Graphs Comb., 2016

An upper bound on the extremal version of Hajnal's triangle-free game.
Discret. Appl. Math., 2016

2015
Standard Examples as Subposets of Posets.
Order, 2015

The rate of growth of the minimum clique size of graphs of given order and chromatic number.
Discret. Math., 2015

Solving SAT by an Iterative Version of the Inclusion-Exclusion Principle.
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.
Electron. J. Comb., 2014

2013
Large Chromatic Number and Ramsey Graphs.
Graphs Comb., 2013

How to generate weakly nondecisive SAT instances.
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.
Discret. Math., 2011

2010
Interval partitions and Stanley depth.
J. Comb. Theory, Ser. A, 2010

Segment Orders.
Discret. Comput. Geom., 2010

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


  Loading...