Gábor Mészáros

According to our database1, Gábor Mészáros authored at least 15 papers between 2013 and 2019.

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

2019
On the Maximum Diameter of Path-Pairable Graphs.
Graphs Comb., 2019

The path-pairability number of products of stars.
Discuss. Math. Graph Theory, 2019

On the Maximum Degree of Path-Pairable Planar Graphs.
Electron. J. Comb., 2019

AUTALASSO: an automatic adaptive LASSO for genome-wide prediction.
BMC Bioinform., 2019

2018
Line Percolation in Finite Projective Planes.
SIAM J. Discret. Math., 2018

On a conjecture of Gentner and Rautenbach.
Discret. Math., 2018

An improved upper bound on the maximum degree of terminal-pairable complete graphs.
Discret. Math., 2018

2017
Note on terminal-pairability in complete grid graphs.
Discret. Math., 2017

2016
On linkedness in the Cartesian product of graphs.
Period. Math. Hung., 2016

On path-pairability in the Cartesian product of graphs.
Discuss. Math. Graph Theory, 2016

2015
Frustrated triangles.
Discret. Math., 2015

Sorting using non-binary comparisons.
CoRR, 2015

2014
Note on the diameter of path-pairable graphs.
Discret. Math., 2014

Compressing IP Forwarding Tables: Realizing Information-Theoretical Space Bounds and Fast Lookups Simultaneously.
Proceedings of the 22nd IEEE International Conference on Network Protocols, 2014

2013
The Survival Kit: Software to analyze survival data including possibly correlated random effects.
Comput. Methods Programs Biomed., 2013


  Loading...