Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDMartin Derka
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j5]Therese C. Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs with Bounded Pathwidth. Algorithmica 82(2): 355-384 (2020)- [c15]Sebastian Banescu, Martin Derka, Jan Gorzny, Sung-Shine Lee, Alex Murashkin:
Constant-Time Updates Using Token Mechanics. Blockchain 2020: 300-304
2010 – 2019
- 2019
- [c14]Alan Arroyo
, Martin Derka, Irene Parada:
Extending Simple Drawings. Graph Drawing 2019: 230-243 - [i14]Alan Arroyo, Martin Derka, Irene Parada:
Extending Simple Drawings. CoRR abs/1908.08129 (2019) - 2018
- [c13]Therese C. Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal, Alexi Turcotte:
Partitioning Orthogonal Histograms into Rectangular Boxes. LATIN 2018: 146-160 - [c12]Therese C. Biedl, Ahmad Biniaz, Martin Derka:
On the Size of Outer-String Representations. SWAT 2018: 10:1-10:14 - 2017
- [c11]Therese C. Biedl, Martin Derka, Vida Dujmovic, Pat Morin:
EPG-representations with Small Grid-Size. Graph Drawing 2017: 184-196 - [c10]Therese C. Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw:
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. Graph Drawing 2017: 305-317 - [c9]Therese C. Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs with Bounded~Pathwidth. ISAAC 2017: 13:1-13:13 - [c8]Therese C. Biedl, Martin Derka:
Order-Preserving 1-String Representations of Planar Graphs. SOFSEM 2017: 283-294 - [c7]Therese C. Biedl, Martin Derka:
Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs. WADS 2017: 157-168 - [i13]Therese C. Biedl, Martin Derka, Vida Dujmovic, Pat Morin:
EPG-representations with small grid-size. CoRR abs/1708.09749 (2017) - [i12]Therese C. 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 C. Biedl, Martin Derka:
The (3, 1)-ordering for 4-connected planar triangulations. J. Graph Algorithms Appl. 20(2): 347-362 (2016) - [j3]Therese C. 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 C. Biedl, Martin Derka:
Order-preserving 1-string representations of planar graphs. CoRR abs/1609.08132 (2016) - [i9]Therese C. Biedl, Markus Chimani, Martin Derka, Petra Mutzel:
Crossing Number for Graphs With Bounded Pathwidth. CoRR abs/1612.03854 (2016) - [i8]Martin Derka, Therese C. 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 C. Biedl, Martin Derka:
1-string B1-VPG-representations of planar partial 3-trees and some subclasses. CCCG 2015 - [c4]Therese C. Biedl, Martin Derka:
1-String B_2-VPG Representation of Planar Graphs. Symposium on Computational Geometry 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 C. Biedl, Martin Derka:
$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses. CoRR abs/1506.07246 (2015) - [i5]Therese C. Biedl, Martin Derka:
The (3, 1)-ordering for 4-connected planar triangulations. CoRR abs/1511.00873 (2015) - 2014
- [c2]Fidel Barrera-Cruz, Therese C. Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour:
Turning Orthogonally Convex Polyhedra into Orthoballs. CCCG 2014 - [i4]Therese C. Biedl, Martin Derka:
1-String CZ-Representation of Planar Graphs. CoRR abs/1409.5816 (2014) - [i3]Therese C. 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ý, Matej Klusácek:
How not to characterize planar-emulable graphs. Adv. Appl. Math. 50(1): 46-68 (2013) - [i2]Therese C. 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ý, Matej Klusácek:
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-02-17 23:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
