default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDImed Zaguia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Imed Zaguia:
Some progress on the Aharoni-Korman conjecture. Discret. Math. 347(10): 114139 (2024)- [j20]Maurice Pouzet, Imed Zaguia:
Hereditary classes of ordered sets of width at most two. Eur. J. Comb. 119: 103813 (2024) - 2022
- [j19]Maurice Pouzet, Imed Zaguia:
Metric properties of incomparability graphs with an emphasis on paths. Contributions Discret. Math. 17(1): 109-141 (2022) - 2021
- [j18]Kai Ting Keshia Yap, David L. Wehlau, Imed Zaguia:
Permutations Avoiding Certain Partially-Ordered Patterns. Electron. J. Comb. 28(3): 3 (2021) - [j17]Imed Zaguia:
Greedy balanced pairs in N-free ordered sets. Discret. Appl. Math. 289: 539-544 (2021) - [j16]Maurice Pouzet, Imed Zaguia:
Graphs containing finite induced paths of unbounded length. Discret. Math. Theor. Comput. Sci. 23(2) (2021) - 2020
- [c1]Maurice Pouzet, Imed Zaguia:
Graphs containing finite induced paths of unbounded length. ALGOS 2020: 37-40
2010 – 2019
- 2019
- [j15]Imed Zaguia:
The 1/3-2/3 Conjecture for Ordered Sets whose Cover Graph is a Forest. Order 36(2): 335-347 (2019) - 2018
- [j14]Thomas Bier, Imed Zaguia:
Some inequalities for orderings of acyclic digraphs. Contributions Discret. Math. 13(1) (2018) - [j13]Christian Delhommé, Imed Zaguia:
Countable linear orders with disjoint infinite intervals are mutually orthogonal. Discret. Math. 341(7): 1885-1899 (2018) - 2017
- [j12]Norbert Sauer, Imed Zaguia:
Permutations avoiding connected graphs. Contributions Discret. Math. 12(2) (2017) - 2014
- [j11]Claude Laflamme, Maurice Pouzet
, Norbert Sauer, Imed Zaguia:
Pairs of orthogonal countable ordinals. Discret. Math. 335: 35-44 (2014) - 2012
- [j10]Imed Zaguia:
The 1/3-2/3 Conjecture for N-Free Ordered Sets. Electron. J. Comb. 19(2): 29 (2012) - 2011
- [j9]Thomas Bier, Imed Zaguia:
Commutativity conditions for groups arising from acyclic directed graphs and posets. Eur. J. Comb. 32(2): 301-307 (2011) - [j8]Norbert Sauer, Imed Zaguia:
The Order on the Rationals has an Orthogonal Order with the Same Order Type. Order 28(3): 377-385 (2011) - [j7]Imed Zaguia:
On the Fixed Point Property for (3 + 1)-Free Ordered Sets. Order 28(3): 465-479 (2011) - 2010
- [j6]Youssef Boudabbous, Imed Zaguia, Nejib Zaguia:
Prime Orders All of Whose Prime Suborders Are Selfdual. Order 27(3): 283-300 (2010)
2000 – 2009
- 2009
- [j5]Maurice Pouzet, Imed Zaguia:
On Minimal Prime Graphs and Posets. Order 26(4): 357-375 (2009) - 2008
- [j4]Imed Zaguia:
Critically prime interval orders. Discret. Math. 308(23): 5727-5734 (2008) - [j3]Imed Zaguia:
Order Extensions and the Fixed Point Property. Order 25(3): 267-279 (2008) - 2007
- [j2]Maurice Pouzet, Imed Zaguia:
Weak orders admitting a perpendicular linear order. Discret. Math. 307(1): 97-107 (2007)
1990 – 1999
- 1998
- [j1]Imed Zaguia:
Prime Two-dimensional Orders and Perpendicular Total Orders. Eur. J. Comb. 19(5): 639-649 (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-10-07 21:22 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:
