![](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
Louis Ibarra
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
2010 – 2019
- 2017
- [j10]Louis Ibarra
:
Computing the clique-separator graph for an interval graph in linear time. Inf. Process. Lett. 124: 21-25 (2017) - 2010
- [j9]Louis Ibarra
:
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs. Algorithmica 58(3): 637-678 (2010)
2000 – 2009
- 2009
- [j8]Louis Ibarra
:
The clique-separator graph for chordal graphs. Discret. Appl. Math. 157(8): 1737-1749 (2009) - [j7]Louis Ibarra
:
A simple algorithm to find Hamiltonian cycles in proper interval graphs. Inf. Process. Lett. 109(18): 1105-1108 (2009) - [c3]Louis Ibarra
:
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs. WALCOM 2009: 190-201 - 2008
- [j6]Louis Ibarra
:
Fully dynamic algorithms for chordal graphs and split graphs. ACM Trans. Algorithms 4(4): 40:1-40:20 (2008) - 2007
- [j5]Jørgen Bang-Jensen
, Jing Huang, Louis Ibarra:
Recognizing and representing proper interval graphs in parallel using merging and sorting. Discret. Appl. Math. 155(4): 442-456 (2007) - 2003
- [j4]L. Sunil Chandran, Louis Ibarra, Frank Ruskey
, Joe Sawada:
Generating and characterizing the perfect elimination orderings of a chordal graph. Theor. Comput. Sci. 307(2): 303-317 (2003) - 2001
- [b1]Louis Ibarra:
Dynamic algorithms for chordal and interval graphs. University of Victoria, Canada, 2001
1990 – 1999
- 1999
- [c2]Louis Ibarra:
Fully Dynamic Algorithms for Chordal Graphs. SODA 1999: 923-924 - 1997
- [j3]Louis Ibarra
:
Finding Pattern Matchings for Permutations. Inf. Process. Lett. 61(6): 293-295 (1997) - 1995
- [j2]Louis Ibarra, Dana S. Richards:
Tree Open Ear Decomposition in Parallel Graph Algorithms. Parallel Process. Lett. 5: 129-138 (1995) - 1993
- [j1]Louis Ibarra
, Dana S. Richards:
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. Parallel Comput. 19(8): 873-886 (1993) - [c1]Louis Ibarra
, Dana S. Richards:
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. MFCS 1993: 506-516
![](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:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint