default search action
Cesim Erten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i4]Abu Reyan Ahmed, Cesim Erten, Stephen G. Kobourov, Jonah Lotz, Jacob Miller, Hamlet Taraz:
Size Should not Matter: Scale-invariant Stress Metrics. CoRR abs/2408.04688 (2024) - 2023
- [j21]Ibrahim Berber, Cesim Erten, Hilal Kazan:
Predator: Predicting the Impact of Cancer Somatic Mutations on Protein-Protein Interactions. IEEE ACM Trans. Comput. Biol. Bioinform. 20(5): 3163-3172 (2023) - 2022
- [j20]Cesim Erten, Aissa Houdjedj, Hilal Kazan, Ahmed Amine Taleb Bahmed:
PersonaDrive: a method for the identification and prioritization of personalized cancer drivers. Bioinform. 38(13): 3407-3414 (2022) - 2021
- [j19]Cesim Erten, Aissa Houdjedj, Hilal Kazan:
Ranking cancer drivers via betweenness-based outlier detection and random walks. BMC Bioinform. 22(1): 62 (2021) - 2020
- [j18]Rafsan Ahmed, Ilyes Baali, Cesim Erten, Evis Hoxha, Hilal Kazan:
MEXCOwalk: mutual exclusion and coverage based random walk to identify cancer modules. Bioinform. 36(3): 872-879 (2020)
2010 – 2019
- 2019
- [j17]Ferhat Alkan, Türker Bíyíkoglu, Marc Demange, Cesim Erten:
Structure of conflict graphs in constraint alignment problems and algorithms. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - 2017
- [j16]Ferhat Alkan, Cesim Erten:
RedNemo: topology-based PPI network reconstruction via repeated diffusion with neighborhood modifications. Bioinform. 33(4): 537-544 (2017) - 2015
- [j15]Ferhat Alkan, Cesim Erten:
SiPAN: simultaneous prediction and alignment of protein-protein interaction networks. Bioinform. 31(14): 2356-2363 (2015) - 2014
- [j14]Ferhat Alkan, Cesim Erten:
BEAMS: backbone extraction and merge strategy for the global many-to-many alignment of multiple PPI networks. Bioinform. 30(4): 531-539 (2014) - [i3]Ferhat Alkan, Türker Bíyíkoglu, Marc Demange, Cesim Erten:
Constrained Alignments of a Pair of Graphs. CoRR abs/1403.7948 (2014) - 2013
- [j13]Ahmet Emre Aladag, Cesim Erten:
SPINAL: scalable protein interaction network alignment. Bioinform. 29(7): 917-924 (2013) - [j12]Gamze Abaka, Türker Bíyíkoglu, Cesim Erten:
CAMPways: constrained alignment framework for the comparative analysis of a pair of metabolic pathways. Bioinform. 29(13): 145-153 (2013) - 2011
- [j11]Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis:
Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica 60(3): 569-592 (2011) - [j10]Ahmet Emre Aladag, Cesim Erten, Melih Sözdinler:
Reliability-Oriented bioinformatic networks visualization. Bioinform. 27(11): 1583-1584 (2011) - 2010
- [j9]Cesim Erten, Melih Sözdinler:
Improving performances of suboptimal greedy iterative biclustering heuristics via localization. Bioinform. 26(20): 2594-2600 (2010) - [j8]Arda Cakiroglu, Cesim Erten:
Fully Decentralized and Collaborative Multilateration Primitives for Uniquely Localizing WSNs. EURASIP J. Wirel. Commun. Netw. 2010 (2010) - [j7]Alon Efrat, David Forrester, Anand Iyer, Stephen G. Kobourov, Cesim Erten, Ozan Kilic:
Force-directed approaches to sensor localization. ACM Trans. Sens. Networks 7(3): 27:1-27:25 (2010)
2000 – 2009
- 2009
- [j6]Olca A. Çakiroglu, Cesim Erten, Ömer Karatas, Melih Sözdinler:
Crossing minimization in weighted bipartite graphs. J. Discrete Algorithms 7(4): 439-452 (2009) - [c17]Cesim Erten, Melih Sözdinler:
Biclustering Expression Data Based on Expanding Localized Substructures. BICoB 2009: 224-235 - [c16]Cesim Erten, Ömer Karatas:
A robust localization framework to handle noisy measurements in wireless sensor networks. ISCIS 2009: 709-714 - [c15]Arda Cakiroglu, Cesim Erten:
Fully Decentralized, Collaborative Multilateration Primitives for Uniquely Localizing WSNs. WASA 2009: 348-357 - 2008
- [c14]Cesim Erten, Melih Sözdinler:
A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs. GD 2008: 439-440 - 2007
- [j5]Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell:
On simultaneous planar graph embeddings. Comput. Geom. 36(2): 117-130 (2007) - [j4]Alon Efrat, Cesim Erten, Stephen G. Kobourov:
Fixed-Location Circular Arc Drawing of Planar Graphs. J. Graph Algorithms Appl. 11(1): 145-164 (2007) - [c13]Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis:
Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 - [c12]Olca A. Çakiroglu, Cesim Erten, Ömer Karatas, Melih Sözdinler:
Crossing Minimization in Weighted Bipartite Graphs. WEA 2007: 122-135 - 2006
- [c11]Alon Efrat, David Forrester, Anand Iyer, Stephen G. Kobourov, Cesim Erten:
Force-Directed Approaches to Sensor Localization. ALENEX 2006: 108-118 - [c10]Patrick Borunda, Chris Brewer, Cesim Erten:
GSPIM: graphical visualization tool for MIPS assembly programming and simulation. SIGCSE 2006: 244-248 - 2005
- [j3]Cesim Erten, Stephen G. Kobourov, Vu Le, Armand Navabi:
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes. J. Graph Algorithms Appl. 9(1): 165-182 (2005) - [j2]Cesim Erten, Stephen G. Kobourov:
Simultaneous Embedding of Planar Graphs with Few Bends. J. Graph Algorithms Appl. 9(3): 347-364 (2005) - [j1]Cesim Erten, Stephen G. Kobourov:
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid. Theory Comput. Syst. 38(3): 313-327 (2005) - 2004
- [c9]Cesim Erten, Stephen G. Kobourov, Chandan Pitta:
Morphing planar graphs. SCG 2004: 451-452 - [c8]Cesim Erten, Stephen G. Kobourov:
Simultaneous Embedding of Planar Graphs with Few Bends. GD 2004: 195-205 - [c7]Cesim Erten, Philip J. Harding, Stephen G. Kobourov, Kevin Wampler, Gary V. Yee:
Exploring the computing literature using temporal graph visualization. Visualization and Data Analysis 2004: 45-56 - 2003
- [c6]Cesim Erten, Philip J. Harding, Stephen G. Kobourov, Kevin Wampler, Gary V. Yee:
GraphAEL: Graph Animations with Evolving Layouts. GD 2003: 98-110 - [c5]Alon Efrat, Cesim Erten, Stephen G. Kobourov:
Fixed-Location Circular-Arc Drawing of Planar Graphs. GD 2003: 147-158 - [c4]Cesim Erten, Stephen G. Kobourov, Chandan Pitta:
Intersection-Free Morphing of Planar Graphs. GD 2003: 320-331 - [c3]Cesim Erten, Stephen G. Kobourov, Vu Le, Armand Navabi:
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes. GD 2003: 437-449 - [c2]Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell:
On Simultaneous Planar Graph Embeddings. WADS 2003: 243-255 - 2002
- [c1]Cesim Erten, Stephen G. Kobourov:
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid. ISAAC 2002: 575-587 - [i2]Christian A. Duncan, Alon Efrat, Cesim Erten, Stephen G. Kobourov, Joseph S. B. Mitchell:
On Simultaneous Graph Embedding. CoRR cs.CG/0206018 (2002) - [i1]Cesim Erten, Stephen G. Kobourov:
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid. CoRR cs.CG/0206019 (2002)
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-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint