default search action
Cristian Frasinaru
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i4]Cristian Frasinaru, Emanuel Florentin Olariu:
Graph4J - A computationally efficient Java library for graph algorithms. CoRR abs/2308.09920 (2023) - 2022
- [j4]Emanuel Florentin Olariu
, Cristian Frasinaru:
Improving lower bounds for equitable chromatic number. Comput. Oper. Res. 143: 105790 (2022) - 2021
- [c10]Emanuel Florentin Olariu, Cristian Frasinaru, Albert Abel Policiuc:
A Branch and Price Algorithm for Coalition Structure Generation over Graphs. ICAART (1) 2021: 390-397 - [c9]Cristian Frasinaru, Emanuel Florentin Olariu:
Generating multi depot vehicle scheduling problems with known optimal tours. KES 2021: 776-785 - [i3]Emanuel Florentin Olariu, Cristian Frasinaru:
Improving Lower Bounds for Equitable Chromatic Number. CoRR abs/2106.03409 (2021) - 2020
- [c8]Ciprian Khlud, Cristian Frasinaru:
A Case Study on Performance Optimization Techniques in Java Programming. ICSOFT 2020: 84-91 - [c7]Emanuel Florentin Olariu, Cristian Frasinaru:
Multiple-Depot Vehicle Scheduling Problem Heuristics. KES 2020: 241-250 - [i2]Emanuel Florentin Olariu, Cristian Frasinaru, Albert Abel Policiuc:
A Branch and Bound Algorithm for Coalition Structure Generation over Graphs. CoRR abs/2004.13425 (2020)
2010 – 2019
- 2019
- [c6]Cristian Frasinaru, Madalina Raschip
An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem. CPAIOR 2019: 292-303 - [c5]Cristian Frasinaru, Madalina Raschip
Greedy Best-First Search for the Optimal-Size Sorting Network Problem. KES 2019: 447-454 - 2018
- [c4]Madalina Raschip
New Evolutionary Approaches for SAT Solving. ICTAI 2018: 522-526 - 2017
- [i1]Cristian Frasinaru, Madalina Raschip:
An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem. CoRR abs/1707.08725 (2017) - 2014
- [c3]Cristian Frasinaru, Florentin Olariu:
Efficient Representation of Extensional Constraints. ICCS 2014: 188-201 - [c2]Emanuel Florentin Olariu, Cristian Frasinaru:
A Lowest Level Rule Push-Relabel Algorithm for Submodular Flows and Matroid Optimization. SYNASC 2014: 97-102 - 2013
- [c1]Cristian Frasinaru, Florentin Olariu:
Reducing the Number of Useless Revisions Performed by Constraint Solvers Based on AC-3. SYNASC 2013: 243-249
2000 – 2009
- 2007
- [j3]Cristian Frasinaru:
Basic Techniques for Creating an Efficient CSP Solver. Sci. Ann. Comput. Sci. 17: 83-112 (2007) - 2004
- [j2]Cornelius Croitoru, Cristian Frasinaru, Elefterie Olaru, Mihai Talmaciu:
Hardly perfect graphs. Sci. Ann. Cuza Univ. 14: 12-22 (2004)
1990 – 1999
- 1998
- [j1]Cornelius Croitoru, Cristian Frasinaru:
Exploring Unknown Undirected Graphs. Sci. Ann. Cuza Univ. 8: 67-76 (1998)
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
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: