Martin Derka

CoRR, 2024

Sequencer Level Security.

[BibT_eX]

[DOI]

CoRR, 2024

A Rollup Comparison Framework.

[BibT_eX]

[DOI]

CoRR, 2024

Requirements Engineering Challenges for Blockchain Rollups.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Requirements Engineering Conference, 2024

SoK: Compression in Rollups.

[BibT_eX]

[DOI]

Roshan Palakkal

Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2024

2023

SoK: Not Quite Water Under the Bridge: Review of Cross-Chain Bridge Hacks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2023

Attacks on Rollups.

[BibT_eX]

[DOI]

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

2022

Ideal properties of rollup escape hatches.

[BibT_eX]

[DOI]

Po-An Lin

Proceedings of the 3rd International Workshop on Distributed Infrastructure for the Common Good, 2022

2020

Crossing Number for Graphs with Bounded Pathwidth.

[BibT_eX]

[DOI]

Algorithmica, 2020

Constant-Time Updates Using Token Mechanics.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Blockchain, 2020

2019

Extending Simple Drawings.

[BibT_eX]

[DOI]

Alan Arroyo

Irene Parada

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

On the Size of Outer-String Representations.

[BibT_eX]

[DOI]

Ahmad Biniaz

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Partitioning Orthogonal Histograms into Rectangular Boxes.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Build a Sporadic Group in Your Basement.

[BibT_eX]

[DOI]

Am. Math. Mon., 2017

Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Order-Preserving 1-String Representations of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

EPG-representations with Small Grid-Size.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

1-string B<sub>2</sub>-VPG representation of planar graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2016

The (3, 1)-ordering for 4-connected planar triangulations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2016

Recognition of Triangulation Duals of Simple Polygons With and Without Holes.

[BibT_eX]

Alejandro López-Ortiz

Daniela Maftuleac

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Planar emulators conjecture is nearly true for cubic graphs.

[BibT_eX]

[DOI]

Petr Hlinený

Eur. J. Comb., 2015

List Colouring Big Graphs On-Line.

[BibT_eX]

[DOI]

Alejandro López-Ortiz

Daniela Maftuleac

CoRR, 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

List Colouring and Partial List Colouring of Graphs On-line.

[BibT_eX]

[DOI]

Alejandro López-Ortiz

Daniela Maftuleac

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

1-String B_2-VPG Representation of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

1-string B1-VPG-representations of planar partial 3-trees and some subclasses.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

1-String CZ-Representation of Planar Graphs.

[BibT_eX]

[DOI]