default search action
Fadoua Ghourabi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c12]Fadoua Ghourabi, Kazuko Takahashi:
What Does Qualitative Spatial Knowledge Tell About Origami Geometric Folds? AISC 2018: 139-154 - [i1]Fadoua Ghourabi, Kazuko Takahashi:
A Proof of the Compositions of Time Interval Relations. CoRR abs/1804.01637 (2018) - 2017
- [c11]Fadoua Ghourabi:
Toward Non-flat Geometrical Origami Folds with Eos System. SYNASC 2017: 75-78 - 2016
- [j3]Fadoua Ghourabi:
Allen's Interval Calculus. Arch. Formal Proofs 2016 (2016) - [e1]James H. Davenport, Fadoua Ghourabi:
7th International Symposium on Symbolic Computation in Software Science, SCSS 2016, Tokyo, Japan, March 28-31, 2016. EPiC Series in Computing 39, EasyChair 2016 [contents] - 2015
- [j2]Tetsuo Ida, Fadoua Ghourabi, Kazuko Takahashi:
Formalizing polygonal knot origami. J. Symb. Comput. 69: 93-108 (2015) - [c10]Fadoua Ghourabi, Kazuko Takahashi:
Formalizing the Qualitative Superposition of Rectangles in Proof Assistant Isabelle/HOL. ICAART (2) 2015: 530-539 - 2013
- [c9]Fadoua Ghourabi, Tetsuo Ida, Kazuko Takahashi:
Logical and Algebraic Views of a Knot Fold of a Regular Heptagon. SCSS 2013: 50-63 - [c8]Tetsuo Ida, Fadoua Ghourabi, Kazuko Takahashi:
Knot Fold of Regular Polygons: Computer-Assisted Construction and Verification. SYNASC 2013: 12-19 - 2012
- [c7]Fadoua Ghourabi, Asem Kasem, Cezary Kaliszyk
:
Algebraic Analysis of Huzita's Origami Operations and Their Extensions. Automated Deduction in Geometry 2012: 143-160 - 2011
- [j1]Tetsuo Ida, Asem Kasem, Fadoua Ghourabi, Hidekazu Takahashi:
Morley's theorem revisited: Origami construction and automated proof. J. Symb. Comput. 46(5): 571-583 (2011) - [c6]Asem Kasem, Fadoua Ghourabi, Tetsuo Ida:
Origami axioms and circle extension. SAC 2011: 1106-1111 - 2010
- [c5]Fadoua Ghourabi, Tetsuo Ida, Asem Kasem:
Proof Documents for Automated Origami Theorem Proving. Automated Deduction in Geometry 2010: 78-97
2000 – 2009
- 2007
- [c4]Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi:
Modeling Origami for Computational Construction and Beyond. ICCSA (2) 2007: 653-665 - [c3]Fadoua Ghourabi, Tetsuo Ida, Hidekazu Takahashi, Mircea Marin
Logical and algebraic view of Huzita's origami axioms with applications to computational origami. SAC 2007: 767-772 - [c2]Tetsuo Ida, Mircea Marin
Computational Origami Construction as Constraint Solving and Rewriting. WFLP@RDP 2007: 31-44 - 2006
- [c1]Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fadoua Ghourabi, Asem Kasem:
Computational Construction of a Maximum Equilateral Triangle Inscribed in an Origami. ICMS 2006: 361-372
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-25 05:47 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: