default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCsaba Biró
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j19]Csaba Biró
, Israel R. Curbelo:
Improved lower bound on the on-line chain partitioning of semi-orders with representation. Discret. Math. 346(12): 113656 (2023)- [j18]Csaba Biró, Jeno Lehel, Géza Tóth:
Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph. Order 40(3): 665-682 (2023) - [j17]Csaba Biró, Israel R. Curbelo:
Improved Lower Bounds on the On-line Chain Partitioning of Posets of Bounded Dimension. Order 40(3): 683-690 (2023) - 2022
- [j16]Csaba Biró, Sida Wan:
Ramsey properties of products of chains. Australas. J Comb. 84: 187-201 (2022) - 2021
- [j15]Csaba Biró, Bartlomiej Bosek, Heather C. Smith, William T. Trotter, Ruidong Wang, Stephen J. Young:
Planar Posets that are Accessible from Below Have Dimension at Most 6. Order 38(1): 21-36 (2021) - 2020
- [j14]Gábor Kusper, Csaba Biró:
Convert a Strongly Connected Directed Graph to a Black-and-White 3-SAT Problem by the Balatonboglár Model. Algorithms 13(12): 321 (2020) - [j13]Gábor Bakó, Zsolt Molnár, Zsófia Szilágyi, Csaba Biró, Edina Morvai, Örs Ábrám, András Molnár:
Accurate Non-Disturbance Population Survey Method of Nesting Colonies in the Reedbed with Georeferenced Aerial Imagery. Sensors 20(9): 2601 (2020) - [c7]Tamás Balla, Csaba Biró, Gábor Kusper:
The BWConverter Toolchain: An Incomplete Way to Convert SAT Problems into Directed Graphs. ICAI 2020: 24-29 - [c6]Gábor Kusper, Csaba Biró, Tamás Balla:
Investigation of the Efficiency of Conversion of Directed Graphs to 3-SAT Problems. SACI 2020: 227-234 - [c5]Gábor Kusper, Tamás Balla, Csaba Biró, Tibor Tajti, Zijian Gyozo Yang, Imre Baják:
Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs. SYNASC 2020: 84-92
2010 – 2019
- 2019
- [b1]Csaba Biró:
Formal Methods for Modelling Wireless Sensor Networks. Eötvös Loránd University, Hungary, 2019 - 2018
- [j12]Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski:
Fine-grained complexity of coloring unit disks and balls. J. Comput. Geom. 9(2): 47-80 (2018) - 2017
- [c4]Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski:
Fine-Grained Complexity of Coloring Unit Disks and Balls. SoCG 2017: 18:1-18:16 - [c3]Gergely Kovásznai, Csaba Biró, Balazs Erdelyi:
Generating Optimal Scheduling for Wireless Sensor Networks by Using Optimization Modulo Theories Solvers. SMT 2017: 15-27 - 2016
- [j11]Csaba Biró, Paul Horn, D. Jacob Wildstrom:
An upper bound on the extremal version of Hajnal's triangle-free game. Discret. Appl. Math. 198: 20-28 (2016) - [j10]Csaba Biró, Peter Hamburger, Attila Pór, William T. Trotter:
Forcing Posets with Large Dimension to Contain Large Standard Examples. Graphs Comb. 32(3): 861-880 (2016) - [j9]Csaba Biró, Mitchel T. Keller, Stephen J. Young:
Posets with Cover Graph of Pathwidth two have Bounded Dimension. Order 33(2): 195-212 (2016) - 2015
- [j8]Csaba Biró, Kris Wease:
The rate of growth of the minimum clique size of graphs of given order and chromatic number. Discret. Math. 338(5): 698-700 (2015) - [j7]Csaba Biró, Peter Hamburger, Attila Pór:
Standard Examples as Subposets of Posets. Order 32(2): 293-299 (2015) - [c2]Gábor Kusper, Csaba Biró:
Solving SAT by an Iterative Version of the Inclusion-Exclusion Principle. SYNASC 2015: 189-190 - 2014
- [j6]Csaba Biró, Peter Hamburger, Attila Pór:
The Proof of the Removable Pair Conjecture for Fractional Dimension. Electron. J. Comb. 21(1): 1 (2014) - 2013
- [j5]Csaba Biró, Zoltán Füredi, Sogol Jahanbekam:
Large Chromatic Number and Ramsey Graphs. Graphs Comb. 29(5): 1183-1191 (2013) - [c1]Csaba Biró, Gábor Kusper, Tibor Tajti:
How to generate weakly nondecisive SAT instances. SISY 2013: 265-269 - 2011
- [j4]Csaba Biró, William T. Trotter:
A combinatorial approach to height sequences in finite partially ordered sets. Discret. Math. 311(7): 563-569 (2011) - 2010
- [j3]Csaba Biró, William T. Trotter:
Segment Orders. Discret. Comput. Geom. 43(3): 680-704 (2010) - [j2]Csaba Biró, David M. Howard, Mitchel T. Keller, William T. Trotter, Stephen J. Young:
Interval partitions and Stanley depth. J. Comb. Theory A 117(4): 475-482 (2010)
2000 – 2009
- 2009
- [j1]Csaba Biró, David M. Howard:
The First Three Levels of an Order Preserving Hamiltonian Path in the Subset Lattice. Order 26(2): 101-107 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
