


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
- Ralf Klasing
University of Bordeaux 1, LABRI, France
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 164 matches
- 2025
- Romaric Duvignau, Vincenzo Gulisano, Marina Papatriantafilou, Ralf Klasing:
Geographical Peer Matching for P2P Energy Sharing. IEEE Access 13: 9718-9738 (2025) - Chenxu Yang, Yaping Mao, Ralf Klasing, Gang Yang, Yuzhi Xiao, Xiaoyan Zhang:
Fault-tolerance in distance-edge-monitoring sets. Acta Informatica 62(1): 9 (2025) - Wen Li, Ralf Klasing, Yaping Mao, Bo Ning:
Monitoring the edges of product networks using distances. J. Comput. Syst. Sci. 148: 103602 (2025) - 2024
- Zhen Ji, Ralf Klasing, Wen Li, Yaping Mao
, Xiaoyan Zhang:
Erdös-Gallai-type problems for distance-edge-monitoring numbers. Discret. Appl. Math. 342: 275-285 (2024) - Chenxu Yang
, Ralf Klasing, Yaping Mao
, Xingchao Deng:
On the distance-edge-monitoring numbers of graphs. Discret. Appl. Math. 342: 153-167 (2024) - Chenxu Yang
, Ralf Klasing, Changxiang He, Yaping Mao:
Perturbation Results for Distance-edge-monitoring Numbers. Fundam. Informaticae 191(2): 141-163 (2024) - Xiaojuan Zhang, Gang Yang, Changxiang He, Ralf Klasing, Yaping Mao:
The number of spanning trees for Sierpiński graphs and data center networks. Inf. Comput. 300: 105194 (2024) - Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. 139: 103476 (2024) - Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Ralf Klasing, Yuzhi Xiao:
The g-extra connectivity of graph products. J. Comput. Syst. Sci. 145: 103552 (2024) - Chenxu Yang
, Gang Yang, Sun-Yuan Hsieh, Yaping Mao, Ralf Klasing:
Monitoring the edges of a graph using distances with given girth. J. Comput. Syst. Sci. 143: 103528 (2024) - Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing:
Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests. AAIM (2) 2024: 99-110 - Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing:
Algorithms and Complexity for Path Covers of Temporal DAGs. MFCS 2024: 38:1-38:17 - Henning Fernau
, Serge Gaspers
, Ralf Klasing:
SOFSEM 2024: Theory and Practice of Computer Science - 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Cochem, Germany, February 19-23, 2024, Proceedings. Lecture Notes in Computer Science 14519, Springer 2024, ISBN 978-3-031-52112-6 [contents] - Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing:
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? CoRR abs/2403.04589 (2024) - Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker:
Online Unbounded Knapsack. CoRR abs/2407.02045 (2024) - Romaric Duvignau, Noël Gillet, Ralf Klasing:
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems. CoRR abs/2410.09434 (2024) - 2023
- Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung
, Chia-Wei Lee, Sun-Yuan Hsieh
:
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks. J. Parallel Distributed Comput. 181: 104731 (2023) - Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
:
The RED-BLUE SEPARATION problem on graphs. Theor. Comput. Sci. 970: 114061 (2023) - Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker
, David Wehner:
Online Knapsack with Removal and Recourse. IWOCA 2023: 123-135 - Romaric Duvignau
, Ralf Klasing:
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems. LAGOS 2023: 43-52 - Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao:
Perturbation results for distance-edge-monitoring numbers. CoRR abs/2301.02507 (2023) - Chenxu Yang, Ping Li, Yaping Mao, Eddie Cheng, Ralf Klasing:
Constructing disjoint Steiner trees in Sierpiński graphs. CoRR abs/2310.16463 (2023) - 2022
- Li-Hsuan Chen
, Sun-Yuan Hsieh, Ling-Ju Hung
, Ralf Klasing:
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality. Algorithmica 84(7): 1993-2027 (2022) - Leszek Gasieniec, Ralf Klasing, Tomasz Radzik
:
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. Algorithmica 84(10): 3103-3106 (2022) - Florent Foucaud, Shih-Shun Kao
, Ralf Klasing, Mirka Miller, Joe Ryan:
Monitoring the edges of a graph using distances. Discret. Appl. Math. 319: 424-438 (2022) - Hao-Ping Yeh, Wei Lu, Li-Hsuan Chen
, Ling-Ju Hung
, Ralf Klasing, Sun-Yuan Hsieh
:
Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs. Theor. Comput. Sci. 922: 13-24 (2022) - Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
:
The Red-Blue Separation Problem on Graphs. IWOCA 2022: 285-298 - Sun-Yuan Hsieh
, Ling-Ju Hung
, Ralf Klasing, Chia-Wei Lee
, Sheng-Lung Peng
:
New Trends in Computer Technologies and Applications - 25th International Computer Symposium, ICS 2022, Taoyuan, Taiwan, December 15-17, 2022, Proceedings. Communications in Computer and Information Science 1723, Springer 2022, ISBN 978-981-19-9581-1 [contents] - Leszek Gasieniec, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik:
Perpetual maintenance of machines with different urgency requirements. CoRR abs/2202.01567 (2022) - Chengxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng:
On the distance-edge-monitoring numbers of graphs. CoRR abs/2211.04920 (2022)
skipping 134 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 2025-02-14 23:08 CET 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