default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 83 matches
- 2024
- Jaehyeok Han, Mee Lan Han, Sangjin Lee, Jungheum Park:
ECo-Bag: An elastic container based on merkle tree as a universal digital evidence bag. Forensic Sci. Int. Digit. Investig. 49: 301725 (2024) - Dohun Kim, Sangjin Lee, Jungheum Park:
Decrypting IndexedDB in private mode of Gecko-based browsers. Forensic Sci. Int. Digit. Investig. 49: 301763 (2024) - 2023
- Geun-Yeong Choi, Jewan Bang, Sangjin Lee, Jungheum Park:
Chracer: Memory analysis of Chromium-based browsers. Forensic Sci. Int. Digit. Investig. 46(Supplement): 301613 (2023) - Jihun Joun, Sangjin Lee, Jungheum Park:
Discovering spoliation of evidence through identifying traces on deleted files in macOS. Forensic Sci. Int. Digit. Investig. 44(Supplement): 301502 (2023) - Jihun Joun, Sangjin Lee, Jungheum Park:
Data remnants analysis of document files in Windows: Microsoft 365 as a case study. Forensic Sci. Int. Digit. Investig. 46(Supplement): 301612 (2023) - Jieon Kim, Jungheum Park, Sangjin Lee:
An improved IoT forensic model to identify interconnectivity between things. Forensic Sci. Int. Digit. Investig. 44: 301499 (2023) - Jihun Son, Gyubin Kim, Hyunwoo Jung, Jewan Bang, Jungheum Park:
IF-DSS: A forensic investigation framework for decentralized storage services. Forensic Sci. Int. Digit. Investig. 46(Supplement): 301611 (2023) - Jung-Heum Park:
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults. Int. J. Found. Comput. Sci. 34(4): 429-441 (2023) - Jung-Heum Park, Hyeong-Seok Lim:
Characterization of interval graphs that are paired 2-disjoint path coverable. J. Supercomput. 79(3): 2783-2800 (2023) - 2022
- Jung-Heum Park:
Unpaired Many-to-Many Disjoint Path Covers in Nonbipartite Torus-Like Graphs With Faulty Elements. IEEE Access 10: 127589-127600 (2022) - Jungheum Park, Hyunji Chung, Joanna F. DeFranco:
Multilayered Diagnostics for Smart Cities. Computer 55(2): 14-22 (2022) - Jewan Bang, Jungheum Park, Sangjin Lee:
Vision: An empirical framework for examiners to accessing password-protected resources for on-the-scene digital investigations. Digit. Investig. 40(Supplement): 301376 (2022) - Jihyeok Yang, Jieon Kim, Jewan Bang, Sangjin Lee, Jungheum Park:
CATCH: Cloud Data Acquisition through Comprehensive and Hybrid Approaches. Digit. Investig. 43(Supplement): 301442 (2022) - Yirang Lim, MinA Youn, Hyunji Chung, Jungheum Park, Graeme Horsman, Sangjin Lee:
Characterizing client-side caches of audiovisual content sharing services: Findings and suggestions for forensics. J. Inf. Secur. Appl. 65: 103102 (2022) - 2021
- Jung-Heum Park:
Torus-like graphs and their paired many-to-many disjoint path covers. Discret. Appl. Math. 289: 64-77 (2021) - Jisung Choi, Jungheum Park, Sangjin Lee:
Forensic exploration on windows File History. Digit. Investig. 36(Supplement): 301134 (2021) - Jungheum Park, Hyunji Chung:
Toward Trustworthy Urban IT Systems: The Bright and Dark Sides of Smart City Development. IT Prof. 23(6): 52-57 (2021) - Jung-Heum Park:
A sufficient condition for the unpaired k-disjoint path coverability of interval graphs. J. Supercomput. 77(7): 6871-6888 (2021) - Jungheum Park, Hyunji Chung:
Toward Trustworthy Urban IT Systems: The Bright and Dark Sides of Smart City Development. CoRR abs/2107.09283 (2021) - Jungheum Park, Hyunji Chung, Joanna F. DeFranco:
Multi-Layered Diagnostics for Smart Cities. CoRR abs/2107.09284 (2021) - 2020
- Jung-Heum Park, Hyeong-Seok Lim:
Characterization of interval graphs that are unpaired 2-disjoint path coverable. Theor. Comput. Sci. 821: 71-86 (2020) - Jaehyeok Han, Jungheum Park, Hyunji Chung, Sangjin Lee:
Forensic analysis of the Windows telemetry for diagnostics. CoRR abs/2002.12506 (2020) - Hyunji Chung, Jungheum Park, Sangjin Lee:
Forensic Analysis of Residual Information in Adobe PDF Files. CoRR abs/2003.10546 (2020) - 2019
- Jung-Heum Park, Insung Ihm:
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph. Inf. Process. Lett. 142: 57-63 (2019) - Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim:
Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs. J. Comput. Syst. Sci. 105: 104-115 (2019) - Jung-Heum Park, Jae-Hoon Kim, Hyeong-Seok Lim:
Disjoint path covers joining prescribed source and sink sets in interval graphs. Theor. Comput. Sci. 776: 125-137 (2019) - 2018
- Jungheum Park:
TREDE and VMPOP: Cultivating multi-purpose datasets for digital forensics - A Windows registry corpus as an example. Digit. Investig. 26: 3-18 (2018) - Jung-Heum Park:
Paired Many-to-Many 3-Disjoint Path Covers in Bipartite Toroidal Grids. J. Comput. Sci. Eng. 12(3): 115-126 (2018) - 2017
- Insung Ihm, Jung-Heum Park:
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph. Discret. Appl. Math. 218: 98-112 (2017) - Hyunji Chung, Jungheum Park, Sangjin Lee:
Digital forensic approaches for Amazon Alexa ecosystem. Digit. Investig. 22 Supplement: S15-S25 (2017)
skipping 53 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-17 03:28 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint