![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Ivaylo Ilinkin
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c14]Ivaylo Ilinkin, Daeun Song, Young J. Kim:
Stroke-Based Rendering and Planning for Robotic Performance of Artistic Drawing. IROS 2023: 8062-8068 - [c13]Ivaylo Ilinkin
:
Variations on "From Nand to Tetris" with Logisim and ARM. ITiCSE (1) 2023: 424-429 - 2022
- [i1]Ivaylo Ilinkin, Daeun Song, Young J. Kim:
Stroke-based Rendering and Planning for Robotic Performance of Artistic Drawing. CoRR abs/2210.07590 (2022) - 2020
- [c12]Ivaylo Ilinkin, Sunghee Kim:
Enhancing CS1 with Mobile Apps. ACE 2020: 211-212 - [c11]Ivaylo Ilinkin:
Designing a Course on Non-Photorealistic Rendering. Eurographics (Education Papers) 2020: 9-16
2010 – 2019
- 2017
- [c10]Ivaylo Ilinkin, Sunghee Kim:
Evaluation of Korean Text Entry Methods for Smartwatches. CHI 2017: 722-726 - 2014
- [c9]Ivaylo Ilinkin:
Visualization of Floater and Gotsman's Morphing Algorithm. SoCG 2014: 94 - [c8]Ivaylo Ilinkin:
Opportunities for android projects in a CS1 course. SIGCSE 2014: 615-620 - 2013
- [c7]Ivaylo Ilinkin:
Parametric search visualization. SoCG 2013: 343-344 - 2010
- [j3]Ivaylo Ilinkin, Jieping Ye, Ravi Janardan:
Multiple structure alignment and consensus identification for proteins. BMC Bioinform. 11: 71 (2010) - [c6]Ivaylo Ilinkin, Sunghee Kim:
Evaluation of text entry methods for Korean mobile phones, a user study. CHI 2010: 2023-2026
2000 – 2009
- 2008
- [c5]Ivaylo Ilinkin, Sunghee Kim:
Design and evaluation of korean text entry methods for mobile phones. CHI Extended Abstracts 2008: 2853-2858 - 2006
- [j2]Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo
, Jörg Schwerdt:
Heuristics for estimating contact area of supports in layered manufacturing. ACM J. Exp. Algorithmics 11 (2006) - [c4]Jieping Ye, Ivaylo Ilinkin, Ravi Janardan, Adam Isom:
Multiple Structure Alignment and Consensus Identification for Proteins. WABI 2006: 115-125 - 2004
- [c3]Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid, Eric Johnson, Paul Castillo, Jörg Schwerdt:
Approximating contact-area of supports in layered manufacturing. CCCG 2004: 91-94 - 2002
- [j1]Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram:
A decomposition-based approach to layered manufacturing. Comput. Geom. 23(2): 117-151 (2002) - [c2]Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid:
Terrain Polygon Decomposition, with Application to Layered Manufacturing. COCOON 2002: 381-390 - 2001
- [c1]Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram:
A Decomposition-Based Approach to Layered Manufacturing. WADS 2001: 389-400
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint