Martin Derka

Orcid: 0000-0001-7514-3004

According to our database1, Martin Derka authored at least 26 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
SoK: Not Quite Water Under the Bridge: Review of Cross-Chain Bridge Hacks.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2023

Attacks on Rollups.
Proceedings of the 4th International Workshop on Distributed Infrastructure for the Common Good, 2023

2022
Ideal properties of rollup escape hatches.
Proceedings of the 3rd International Workshop on Distributed Infrastructure for the Common Good, 2022

2020
Crossing Number for Graphs with Bounded Pathwidth.
Algorithmica, 2020

Constant-Time Updates Using Token Mechanics.
Proceedings of the IEEE International Conference on Blockchain, 2020

2019
Extending Simple Drawings.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018
On the Size of Outer-String Representations.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Partitioning Orthogonal Histograms into Rectangular Boxes.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Build a Sporadic Group in Your Basement.
Am. Math. Mon., 2017

Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Order-Preserving 1-String Representations of Planar Graphs.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

EPG-representations with Small Grid-Size.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016
1-string B<sub>2</sub>-VPG representation of planar graphs.
J. Comput. Geom., 2016

The (3, 1)-ordering for 4-connected planar triangulations.
J. Graph Algorithms Appl., 2016

Recognition of Triangulation Duals of Simple Polygons With and Without Holes.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Planar emulators conjecture is nearly true for cubic graphs.
Eur. J. Comb., 2015

List Colouring Big Graphs On-Line.
CoRR, 2015

$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses.
CoRR, 2015

List Colouring and Partial List Colouring of Graphs On-line.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

1-String B_2-VPG Representation of Planar Graphs.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

1-string B1-VPG-representations of planar partial 3-trees and some subclasses.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
1-String CZ-Representation of Planar Graphs.
CoRR, 2014

Turning Orthogonally Convex Polyhedra into Orthoballs.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Dihedral angles and orthogonal polyhedra.
CoRR, 2013

How not to characterize planar-emulable graphs.
Adv. Appl. Math., 2013


  Loading...