#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2008

2017

- This year (0)
- Last 5 years (17)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Csaba Biró, Peter Hamburger, Attila Pór, William T. Trotter
- Graphs and Combinatorics
- 2016

The dimension of a poset P , denoted dim(P ), is the least positive integer d for which P is the intersection of d linear extensions of P . The maximum dimension of a poset P with |P | ≤ 2n+ 1 is n,… (More)

- Csaba Biró, Gábor Kusper, Tibor Tajti
- 2013 IEEE 11th International Symposium on…
- 2013

In this paper we solve a problem which was unsolved until now. The problem is: How to generate weakly nondecisive SAT instances? As a solution we introduce a very simple algorithm, called WnDGen,… (More)

Wireless Sensor Networks (WSNs) serve as the basis for today’s Internet of Things applications. A WSN consists of a number of spatially distributed sensor nodes, which cooperatively monitor physical… (More)

- Csaba Biró, Paul Horn, D. Jacob Wildstrom
- Discrete Applied Mathematics
- 2016

- Csaba Biró, David M. Howard, Mitchel T. Keller, William T. Trotter, Stephen J. Young
- J. Comb. Theory, Ser. A
- 2010

In this paper, we answer a question posed by Herzog, Vladoiu, and Zheng. Their motivation involves a 1982 conjecture of Richard Stanley concerning what is now called the Stanley depth of a module.… (More)

- Csaba Biró, Mitchel T. Keller, Stephen J. Young
- Order
- 2016

Joret, Micek, Milans, Trotter, Walczak, and Wang recently asked if there exists a constant d such that if P is a poset with cover graph of P of pathwidth at most 2, then dim(P ) ≤ d. We answer this… (More)

- Csaba Biró, Édouard Bonnet, Dániel Marx, Tillmann Miltzow, Pawel Rzazewski
- Symposium on Computational Geometry
- 2017

On planar graphs, many classic algorithmic problems enjoy a certain “square root phenomenon” and can be solved significantly faster than what is known to be possible on general graphs: for example,… (More)

- Csaba Biró, Peter Hamburger, Attila Pór
- Order
- 2015

We prove that a poset with no induced subposet Sk (for fixed k ≥ 3) must have dimension that is sublinear in terms of the number of elements.

- Csaba Biró, William T. Trotter
- Discrete & Computational Geometry
- 2010

We study two kinds of segment orders, using definitions first proposed by Farhad Shahrokhi. Although the two kinds of segment orders appear to be quite different, we prove several results suggesting… (More)

- Gábor Kusper, Csaba Biró
- 2015 17th International Symposium on Symbolic and…
- 2015

Our goal is to present a basic, novel, and correct SAT solver algorithm, show its soundness, compare it with a standard SAT solver, give some ideas in which cases might it be competitive. We do not… (More)