default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnastasia Kurdia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c13]Lea Wittie, Anastasia Kurdia, Judy Peng, James Kelly, Meriel Huggard
:
Developing a Concept Inventory for Computer Science 2: What should it focus on and what makes it challenging? FIE 2020: 1-8
2010 – 2019
- 2018
- [c12]Amardeep Kahlon, Bonnie K. MacKellar, Anastasia Kurdia:
Combating the Wide Web of Plagiarism: the Discussion Continues (Abstract Only). SIGCSE 2018: 1069 - [c11]Lea Wittie, Anastasia Kurdia, Meriel Huggard:
Recruiting Experts: Toward a Concept Inventory for Computer Science 2 (Abstract Only). SIGCSE 2018: 1104 - 2017
- [c10]Lea Wittie, Anastasia Kurdia, Meriel Huggard:
Developing a concept inventory for computer science 2. FIE 2017: 1-4 - [c9]Amardeep Kahlon, Bonnie K. MacKellar, Anastasia Kurdia:
GitHub, Tutors, Relatives, and Friends: The Wide Web of Plagiarism (Abstract Only). SIGCSE 2017: 726 - 2014
- [c8]Christine Chung, Shenoda Guirguis, Anastasia Kurdia:
Competitive Cost-Savings in Data Stream Management Systems. COCOON 2014: 129-140 - 2012
- [j2]Marko Zivanic, Ovidiu Daescu, Anastasia Kurdia, S. R. Goodman:
The Voronoi diagram for graphs and its application in the Sickle Cell Disease research. J. Comput. Sci. 3(5): 335-343 (2012) - 2011
- [c7]Marko Zivanic, Ovidiu Daescu, Anastasia Kurdia:
Rigid region pairwise sequence alignment. BIBM Workshops 2011: 319-326 - [c6]Giovanni Viglietta, Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia:
Edge-guarding Orthogonal Polyhedra. CCCG 2011 - 2010
- [c5]Steven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk:
Visiting a Sequence of Points with a Bevel-Tip Needle. LATIN 2010: 492-502
2000 – 2009
- 2009
- [j1]Ovidiu Daescu, Anastasia Kurdia:
Towards an optimal algorithm for recognizing Laman graphs. J. Graph Algorithms Appl. 13(2): 219-232 (2009) - [c4]Ovidiu Daescu, Anastasia Kurdia:
Towards an Optimal Algorithm for Recognizing Laman Graphs. HICSS 2009: 1-10 - [c3]Ovidiu Daescu, Anastasia Kurdia:
Polygonal chain simplification for flight simulation systems. SpringSim 2009 - 2008
- [c2]Yam Ki Cheung, Ovidiu Daescu, Anastasia Kurdia:
A New Modeling for Finding Optimal Weighted Distances. BIOTECHNO 2008: 41-46 - [c1]Ovidiu Daescu, Anastasia Kurdia:
Polygonal Chain Simplification with Small Angle Constraints. CCCG 2008
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 22:11 CEST 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:
