default search action
Branko Kaucic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c12]Marjan Krasna, Danilo Korze, Branko Kaucic:
Searching for the reasons why ICT is not adequately used in schools. MIPRO 2018: 812-818 - 2017
- [c11]Andrej Tibaut, Branko Kaucic, Daniela Dvornik Perhavec, Piero Tiano, João Martins:
Ontologizing the Heritage Building Domain. DCH@ICE/ITMC 2017: 141-161 - [c10]Andrej Tibaut, Daniela Dvornik Perhavec, Branko Kaucic:
Knowledge modelling of buildings: Use case for heritage buildings. ICE/ITMC 2017: 1414-1418 - [c9]Andrej Tibaut, Branko Kaucic, Daniela Dvornik Perhavec:
Ontology-Based Data Collection for Heritage Buildings. ITN-DCH 2017: 63-78 - 2012
- [j5]Andrej Tibaut, Branko Kaucic, Danijel Rebolj:
A standardised approach for sustainable interoperability between public transport passenger information systems. Comput. Ind. 63(8): 788-798 (2012) - [c8]Marjan Krasna, Robert Repnik, Tomaz Bratina, Branko Kaucic:
Advanced types of electronic testing of student's performance. MIPRO 2012: 1198-1204 - 2011
- [c7]Branko Kaucic, Teja Asic:
Improving introductory programming with Scratch? MIPRO 2011: 1095-1100 - 2010
- [c6]Branko Kaucic, Dejan Sraka, Maja Ramsak, Marjan Krasna:
Observations on Plagiarism in Programming Courses. CSEDU (2) 2010: 181-184 - [c5]Urska Bucar, Branko Kaucic:
Interactive Whiteboard and Geometry Lessons in Primary School. CSEDU (1) 2010: 446-449
2000 – 2009
- 2009
- [c4]Dejan Sraka, Branko Kaucic:
Source code plagiarism. ITI 2009: 461-466 - 2008
- [j4]Irena Nancovska Serbec, Branko Kaucic, Joze Rugelj:
Pair Programming as a Modern Method of Teaching Computer Science. Int. J. Emerg. Technol. Learn. 3(S2): 45-49 (2008) - 2005
- [j3]Branko Kaucic:
Approximative Terrain Guarding With Given Number of Guards. J. Comput. Inf. Technol. 13(4): 307-312 (2005) - 2004
- [j2]Branko Kaucic, Borut Zalik:
K-guarding of polyhedral terrain. Int. J. Geogr. Inf. Sci. 18(7): 709-718 (2004) - 2003
- [j1]Branko Kaucic, Borut Zalik, Franc Novak:
On the Lower Bound of Edge Guards of Polyhedral Terrains. Int. J. Comput. Math. 80(7): 811-814 (2003) - 2002
- [c3]Branko Kaucic, Borut Zalik:
Comparison of viewshed algorithms on regular spaced points. SCCG 2002: 177-183 - [c2]Branko Kaucic, Borut Zalik:
An Overview of Visibility Problem Algorithms in 1, 5D. WSCG 2002: 241-248
1990 – 1999
- 1999
- [c1]Andrej Tibaut, Branko Kaucic, Danijel Rebolj:
Fast 3D Visualization of Road Product Models. IV 1999: 572-581
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-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint