default search action
Martin Derka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c20]Roshan Palakkal, Jan Gorzny, Martin Derka:
SoK: Compression in Rollups. ICBC 2024: 712-728 - [c19]Jan Gorzny, Martin Derka:
Requirements Engineering Challenges for Blockchain Rollups. RE Workshops 2024: 340-347 - [i18]Jan Gorzny, Martin Derka:
A Rollup Comparison Framework. CoRR abs/2404.16150 (2024) - [i17]Martin Derka, Jan Gorzny, Diego Siqueira, Donato Pellegrino, Marius Guggenmos, Zhiyang Chen:
Sequencer Level Security. CoRR abs/2405.01819 (2024) - [i16]Zhiyang Chen, Jan Gorzny, Martin Derka:
Instrumenting Transaction Trace Properties in Smart Contracts: Extending the EVM for Real-Time Security. CoRR abs/2408.14621 (2024) - 2023
- [c18]Adrian Koegl
, Zeeshan Meghji
Attacks on Rollups. DICG@Middleware 2023: 25-30 - [c17]Sung-Shine Lee, Alexandr Murashkin, Martin Derka, Jan Gorzny:
SoK: Not Quite Water Under the Bridge: Review of Cross-Chain Bridge Hacks. ICBC 2023: 1-14 - 2022
- [c16]Jan Gorzny
Ideal properties of rollup escape hatches. DICG@Middleware 2022: 7-12 - [i15]Sung-Shine Lee, Alexandr Murashkin, Martin Derka, Jan Gorzny:
SoK: Not Quite Water Under the Bridge: Review of Cross-Chain Bridge Hacks. CoRR abs/2210.16209 (2022) - 2020
- [j6]Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel
Crossing Number for Graphs with Bounded Pathwidth. Algorithmica 82(2): 355-384 (2020) - [c15]Sebastian Banescu
Constant-Time Updates Using Token Mechanics. Blockchain 2020: 300-304
2010 – 2019
- 2019
- [c14]Alan Arroyo
Extending Simple Drawings. GD 2019: 230-243 - [i14]Alan Arroyo, Martin Derka, Irene Parada:
Extending Simple Drawings. CoRR abs/1908.08129 (2019) - 2018
- [c13]Therese Biedl, Martin Derka, Veronika Irvine, Anna Lubiw
Partitioning Orthogonal Histograms into Rectangular Boxes. LATIN 2018: 146-160 - [c12]Therese Biedl, Ahmad Biniaz, Martin Derka:
On the Size of Outer-String Representations. SWAT 2018: 10:1-10:14 - 2017
- [j5]Paul E. Becker, Martin Derka, Sheridan K. Houghten, Jennifer Ulrich:
Build a Sporadic Group in Your Basement. Am. Math. Mon. 124(4): 291-305 (2017) - [c11]Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin
EPG-representations with Small Grid-Size. GD 2017: 184-196 - [c10]Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw:
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. GD 2017: 305-317 - [c9]Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel
Crossing Number for Graphs with Bounded~Pathwidth. ISAAC 2017: 13:1-13:13 - [c8]Therese Biedl, Martin Derka:
Order-Preserving 1-String Representations of Planar Graphs. SOFSEM 2017: 283-294 - [c7]Therese Biedl, Martin Derka:
Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs. WADS 2017: 157-168 - [i13]Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin:
EPG-representations with small grid-size. CoRR abs/1708.09749 (2017) - [i12]Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw:
Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges. CoRR abs/1709.01456 (2017) - 2016
- [j4]Therese Biedl, Martin Derka:
The (3, 1)-ordering for 4-connected planar triangulations. J. Graph Algorithms Appl. 20(2): 347-362 (2016) - [j3]Therese Biedl, Martin Derka:
1-string B2-VPG representation of planar graphs. J. Comput. Geom. 7(2): 191-215 (2016) - [c6]Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
Recognition of Triangulation Duals of Simple Polygons With and Without Holes. CCCG 2016: 57-62 - [i11]Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
Recognition of Triangulation Duals of Simple Polygons With and Without Holes. CoRR abs/1607.05739 (2016) - [i10]Therese Biedl, Martin Derka:
Order-preserving 1-string representations of planar graphs. CoRR abs/1609.08132 (2016) - [i9]Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs With Bounded Pathwidth. CoRR abs/1612.03854 (2016) - [i8]Martin Derka, Therese Biedl:
Splitting $B_2$-VPG graphs into outer-string and co-comparability graphs. CoRR abs/1612.07276 (2016) - 2015
- [j2]Martin Derka, Petr Hlinený
Planar emulators conjecture is nearly true for cubic graphs. Eur. J. Comb. 48: 63-70 (2015) - [c5]Therese Biedl, Martin Derka:
1-string B1-VPG-representations of planar partial 3-trees and some subclasses. CCCG 2015 - [c4]Therese Biedl, Martin Derka:
1-String B_2-VPG Representation of Planar Graphs. SoCG 2015: 141-155 - [c3]Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
List Colouring and Partial List Colouring of Graphs On-line. IWOCA 2015: 124-135 - [i7]Martin Derka, Alejandro López-Ortiz, Daniela Maftuleac:
List Colouring Big Graphs On-Line. CoRR abs/1502.02557 (2015) - [i6]Therese Biedl, Martin Derka:
$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses. CoRR abs/1506.07246 (2015) - [i5]Therese Biedl, Martin Derka:
The (3, 1)-ordering for 4-connected planar triangulations. CoRR abs/1511.00873 (2015) - 2014
- [c2]Fidel Barrera-Cruz, Therese Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour:
Turning Orthogonally Convex Polyhedra into Orthoballs. CCCG 2014 - [i4]Therese Biedl, Martin Derka:
1-String CZ-Representation of Planar Graphs. CoRR abs/1409.5816 (2014) - [i3]Therese Biedl, Martin Derka:
$1$-String $B_2$-VPG Representation of Planar Graphs. CoRR abs/1411.7277 (2014) - 2013
- [j1]Markus Chimani, Martin Derka, Petr Hlinený
How not to characterize planar-emulable graphs. Adv. Appl. Math. 50(1): 46-68 (2013) - [i2]Therese Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour:
Dihedral angles and orthogonal polyhedra. CoRR abs/1312.6824 (2013) - 2011
- [c1]Markus Chimani, Martin Derka, Petr Hlinený
How Not to Characterize Planar-Emulable Graphs. IWOCA 2011: 106-120 - [i1]Markus Chimani, Martin Derka, Petr Hlinený, Matej Klusácek:
How Not to Characterize Planar-emulable Graphs. CoRR abs/1107.0176 (2011)
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-11-15 19:31 CET 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: