Pascal Ochem - RankMe

124 papers A* 1B 2C 2Journal 115Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	More characterizations of morphic words. Theor. Comput. Sci. Golnaz Badkobeh, Pascal Ochem
2025	J	`jnl`	4-tangrams are 4-avoidable. CoRR Pascal Ochem, Théo Pierron
2025	J	`jnl`	4-tangrams are 4-avoidable. Discret. Math. Theor. Comput. Sci. Pascal Ochem, Théo Pierron
2025	J	`jnl`	Acyclic, star and injective colouring: A complexity picture for H-free graphs. J. Comput. Syst. Sci. Jan Bok, Nikola Jedlicková, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
2025	J	`jnl`	Complement Avoidance in Binary Words. Electron. J. Comb. James D. Currie, L'ubomíra Dvoráková, Pascal Ochem, Daniela Opocenská, Narad Rampersad, Jeffrey O. Shallit
2025	J	`jnl`	Words avoiding the morphic images of most of their factors. Discret. Math. Theor. Comput. Sci. Pascal Ochem, Matthieu Rosenfeld
2024	J	`jnl`	Critical Exponent of Binary Words with Few Distinct Palindromes. Electron. J. Comb. L'ubomíra Dvoráková, Pascal Ochem, Daniela Opocenská
2023	J	`jnl`	Antisquares and Critical Exponents. Discret. Math. Theor. Comput. Sci. Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2023	J	`jnl`	Contact graphs of boxes with unidirectional contacts. CoRR Daniel Gonçalves, Vincent Limouzy, Pascal Ochem
2023	J	`jnl`	Contact graphs of boxes with unidirectional contacts. Discret. Math. Theor. Comput. Sci. Daniel Gonçalves, Vincent Limouzy, Pascal Ochem
2023	J	`jnl`	Critical exponent of binary words with few distinct palindromes. CoRR L'ubomíra Dvoráková, Pascal Ochem, Daniela Opocenská
2023	J	`jnl`	Doubled Patterns with Reversal and Square-Free Doubled Patterns. Electron. J. Comb. Antoine Domenech, Pascal Ochem
2023	J	`jnl`	Properties of a ternary infinite word. RAIRO Theor. Informatics Appl. James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2023	J	`jnl`	Pseudoperiodic Words and a Question of Shevelev. Discret. Math. Theor. Comput. Sci. Joseph Meleshko, Pascal Ochem, Jeffrey O. Shallit, Sonja Linghui Shan
2022	J	`jnl`	Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
2022	J	`jnl`	Antisquares and Critical Exponents. CoRR Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2022	J	`jnl`	Avoiding square-free words on free groups. Theor. Comput. Sci. Golnaz Badkobeh, Tero Harju, Pascal Ochem, Matthieu Rosenfeld
2022	J	`jnl`	Complement Avoidance in Binary Words. CoRR James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2022	J	`jnl`	Properties of a Ternary Infinite Word. CoRR James D. Currie, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2022	J	`jnl`	Pseudoperiodic Words and a Question of Shevelev. CoRR Joseph Meleshko, Pascal Ochem, Jeffrey O. Shallit, Sonja Linghui Shan
2021	J	`jnl`	A family of formulas with reversal of arbitrarily high avoidability index. Theor. Comput. Sci. Pascal Ochem
2021	J	`jnl`	Avoidability of Palindrome Patterns. Electron. J. Comb. Pascal Ochem, Matthieu Rosenfeld
2021	—	`conf`	Doubled Patterns with Reversal Are 3-Avoidable. WORDS Pascal Ochem
2021	J	`jnl`	Homomorphisms of planar ( Discret. Math. Fabien Jacques, Pascal Ochem
2020	J	`jnl`	Avoiding conjugacy classes on the 5-letter alphabet. RAIRO Theor. Informatics Appl. Golnaz Badkobeh, Pascal Ochem
2020	J	`jnl`	Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
2020	J	`jnl`	On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. Discret. Appl. Math. Borut Luzar, Martina Mockovciaková, Pascal Ochem, Alexandre Pinlou, Roman Soták
2020	J	`jnl`	Oriented cliques and colorings of graphs with low maximum degree. Discret. Math. Janusz Dybizbanski, Pascal Ochem, Alexandre Pinlou, Andrzej Szepietowski
2020	J	`jnl`	Partitioning sparse graphs into an independent set and a graph with bounded size components. Discret. Math. Ilkyoo Choi, François Dross, Pascal Ochem
2019	J	`jnl`	Complexity of planar signed graph homomorphisms to cycles. CoRR François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
2019	—	`book`	Evitement de motif. Pascal Ochem
2019	—	`conf`	New Results on Pseudosquare Avoidance. WORDS Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2019	J	`jnl`	New results on pseudosquare avoidance. CoRR Tim Ng, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2019	J	`jnl`	On Some Interesting Ternary Formulas. Electron. J. Comb. Pascal Ochem, Matthieu Rosenfeld
2019	J	`jnl`	On the Kőnig?Egerváry theorem for k?paths. J. Graph Theory Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
2019	J	`jnl`	Oriented coloring of graphs with low maximum degree. CoRR Pascal Ochem, Alexandre Pinlou
2019	J	`jnl`	Oriented incidence colourings of digraphs. Discuss. Math. Graph Theory Christopher Duffy, Gary MacGillivray, Pascal Ochem, André Raspaud
2019	J	`jnl`	Partitioning sparse graphs into an independent set and a graph with bounded size components. CoRR Ilkyoo Choi, François Dross, Pascal Ochem
2019	J	`jnl`	Repetition avoidance in products of factors. Theor. Comput. Sci. Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi
2019	J	`jnl`	Some further results on squarefree arithmetic progressions in infinite words. CoRR James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
2019	J	`jnl`	Some further results on squarefree arithmetic progressions in infinite words. Theor. Comput. Sci. James D. Currie, Tero Harju, Pascal Ochem, Narad Rampersad
2019	J	`jnl`	Vertex partitions of (C3, C4, C6)-free planar graphs. Discret. Math. François Dross, Pascal Ochem
2018	J	`jnl`	Avoidability of circular formulas. Theor. Comput. Sci. Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold
2018	J	`jnl`	Avoiding conjugacy classes on the 5-letter alphabet. CoRR Golnaz Badkobeh, Pascal Ochem
2018	J	`jnl`	On Repetition Thresholds of Caterpillars and Trees of Bounded Degree. Electron. J. Comb. Borut Luzar, Pascal Ochem, Alexandre Pinlou
2018	J	`jnl`	Repetition avoidance in products of factors. CoRR Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi
2017	J	`jnl`	2-subcoloring is NP-complete for planar comparability graphs. CoRR Pascal Ochem
2017	J	`jnl`	2-subcoloring is NP-complete for planar comparability graphs. Inf. Process. Lett. Pascal Ochem
2017	J	`jnl`	Avoidability of Formulas with Two Variables. Electron. J. Comb. Pascal Ochem, Matthieu Rosenfeld
2017	J	`jnl`	Bounds on the exponential domination number. Discret. Math. Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
2017	J	`jnl`	Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs. J. Graph Theory Pascal Ochem, Alexandre Pinlou, Sagnik Sen
2017	—	`conf`	On Some Interesting Ternary Formulas. WORDS Pascal Ochem, Matthieu Rosenfeld
2017	J	`jnl`	On repetition thresholds of caterpillars and trees of bounded degree. CoRR Borut Luzar, Pascal Ochem, Alexandre Pinlou
2017	J	`jnl`	On some interesting ternary formulas. CoRR Pascal Ochem, Matthieu Rosenfeld
2017	J	`jnl`	Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms. Inf. Process. Lett. Pascal Ochem, Nazanin Movarraei
2017	J	`jnl`	The complexity of partitioning into disjoint cliques and a triangle-free graph. Discret. Appl. Math. Marin Bougeret, Pascal Ochem
2017	J	`jnl`	Vertex partitions of (C CoRR François Dross, Pascal Ochem
2016	J	`jnl`	A short proof that shuffle squares are 7-avoidable. RAIRO Theor. Informatics Appl. Guillaume Guégan, Pascal Ochem
2016	C	`conf`	Avoidability of Formulas with Two Variables. DLT Pascal Ochem, Matthieu Rosenfeld
2016	J	`jnl`	Avoidability of circular formulas. CoRR Guilhem Gamard, Pascal Ochem, Gwénaël Richomme, Patrice Séébold
2016	J	`jnl`	Avoidability of formulas with two variables. CoRR Pascal Ochem, Matthieu Rosenfeld
2016	J	`jnl`	Doubled Patterns are 3-Avoidable. Electron. J. Comb. Pascal Ochem
2016	J	`jnl`	Exponential Domination in Subcubic Graphs. Electron. J. Comb. Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
2016	J	`jnl`	Islands in Graphs on Surfaces. SIAM J. Discret. Math. Louis Esperet, Pascal Ochem
2016	J	`jnl`	On interval representations of graphs. Discret. Appl. Math. Aquiles Braga de Queiroz, Valentin Garnero, Pascal Ochem
2015	J	`jnl`	Characterization of some binary words with few squares. Theor. Comput. Sci. Golnaz Badkobeh, Pascal Ochem
2015	J	`jnl`	Complexity dichotomy for oriented homomorphism of planar graphs with large girth. Theor. Comput. Sci. Guillaume Guégan, Pascal Ochem
2015	J	`jnl`	Doubled patterns are 3-avoidable. CoRR Pascal Ochem
2015	J	`jnl`	Near-Colorings: Non-Colorable Graphs and NP-Completeness. Electron. J. Comb. Mickaël Montassier, Pascal Ochem
2015	J	`jnl`	The Maximum Clique Problem in Multiple Interval Graphs. Algorithmica Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
2015	J	`jnl`	The complexity of partitioning into disjoint cliques and a triangle-free graph. CoRR Marin Bougeret, Pascal Ochem
2014	J	`jnl`	Application of Entropy Compression in Pattern Avoidance. Electron. J. Comb. Pascal Ochem, Alexandre Pinlou
2014	J	`jnl`	Binary patterns in binary cube-free words: Avoidability and growth. RAIRO Theor. Informatics Appl. Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur
2014	J	`jnl`	Homomorphisms of signed planar graphs. CoRR Pascal Ochem, Alexandre Pinlou, Sagnik Sen
2014	J	`jnl`	More on Square-free Words Obtained from Prefixes by Permutations. Fundam. Informaticae Pascal Ochem
2014	J	`jnl`	On the number of prime factors of an odd perfect number. Math. Comput. Pascal Ochem, Michaël Rao
2014	J	`jnl`	Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Graphs Comb. Pascal Ochem, Alexandre Pinlou
2014	J	`jnl`	Vertex Partitions of Graphs into Cographs and Stars. J. Graph Theory Paul Dorbec, Mickaël Montassier, Pascal Ochem
2013	J	`jnl`	A Complexity Dichotomy for the Coloring of Sparse Graphs. J. Graph Theory Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
2013	J	`jnl`	Application of entropy compression in pattern avoidance CoRR Pascal Ochem, Alexandre Pinlou
2013	J	`jnl`	Binary Patterns in Binary Cube-Free Words: Avoidability and Growth CoRR Robert Mercas, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur
2013	J	`jnl`	Strong edge-colouring and induced matchings. Inf. Process. Lett. Hervé Hocquard, Pascal Ochem, Petru Valicov
2012	J	`jnl`	Locally Identifying Coloring of Graphs. Electron. J. Comb. Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau
2012	J	`jnl`	Odd perfect numbers are greater than 10 Math. Comput. Pascal Ochem, Michaël Rao
2012	J	`jnl`	Repetition thresholds for subdivided graphs and trees. RAIRO Theor. Informatics Appl. Pascal Ochem, Elise Vaslet
2012	J	`jnl`	Sieve methods for odd perfect numbers. Math. Comput. S. Adam Fletcher, Pace P. Nielsen, Pascal Ochem
2012	J	`jnl`	The Maximum Clique Problem in Multiple Interval Graphs CoRR Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
2012	B	`conf`	The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract). WG Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
2011	J	`jnl`	Bounds and complexity results for strong edge colouring of subcubic graphs. Electron. Notes Discret. Math. Hervé Hocquard, Pascal Ochem, Petru Valicov
2011	J	`jnl`	Bounds for the generalized repetition threshold. Theor. Comput. Sci. Francesca Fiorenzi, Pascal Ochem, Elise Vaslet
2011	J	`jnl`	Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. Electron. Notes Discret. Math. Pascal Ochem, Alexandre Pinlou
2011	J	`jnl`	Thue choosability of trees. Discret. Appl. Math. Francesca Fiorenzi, Pascal Ochem, Patrice Ossona de Mendez, Xuding Zhu
2010	J	`jnl`	Binary words avoiding the pattern AABBCABBA. RAIRO Theor. Informatics Appl. Pascal Ochem
2010	J	`jnl`	Homomorphisms of 2-edge-colored graphs. Discret. Appl. Math. Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
2010	J	`jnl`	Locally identifying coloring of graphs CoRR Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau
2010	J	`jnl`	On maximal repetitions of arbitrary exponent. Inf. Process. Lett. Roman Kolpakov, Gregory Kucherov, Pascal Ochem
2010	J	`jnl`	Planar Graphs Have 1-string Representations. Discret. Comput. Geom. Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
2010	J	`jnl`	Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most J. Graph Theory Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud
2009	J	`jnl`	On circle graphs with girth at least five. Discret. Math. Louis Esperet, Pascal Ochem
2009	J	`jnl`	On maximal repetitions of arbitrary exponent CoRR Roman Kolpakov, Gregory Kucherov, Pascal Ochem
2009	J	`jnl`	On star and caterpillar arboricity. Discret. Math. Daniel Gonçalves, Pascal Ochem
2008	J	`jnl`	Avoiding Approximate Squares. Int. J. Found. Comput. Sci. Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2008	J	`jnl`	Dejean's conjecture and letter frequency. RAIRO Theor. Informatics Appl. Jérémie Chalopin, Pascal Ochem
2008	J	`jnl`	Homomorphisms of 2-edge-colored graphs. Electron. Notes Discret. Math. Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Éric Sopena
2008	J	`jnl`	On induced-universal graphs for the class of bounded-degree graphs. Inf. Process. Lett. Louis Esperet, Arnaud Labourel, Pascal Ochem
2008	J	`jnl`	On the oriented chromatic index of oriented graphs. J. Graph Theory Pascal Ochem, Alexandre Pinlou, Éric Sopena
2008	J	`jnl`	Oriented colorings of partial 2-trees. Inf. Process. Lett. Pascal Ochem, Alexandre Pinlou
2008	J	`jnl`	Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discret. Math. Theor. Comput. Sci. Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
2008	J	`jnl`	Strong oriented chromatic number of planar graphs without cycles of specific lengths. Electron. Notes Discret. Math. Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
2007	C	`conf`	Avoiding Approximate Squares. Developments in Language Theory Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2007	J	`jnl`	Dejean's conjecture and letter frequency. Electron. Notes Discret. Math. Jérémie Chalopin, Pascal Ochem
2007	J	`jnl`	Letter frequency in infinite repetition-free words. Theor. Comput. Sci. Pascal Ochem
2007	J	`jnl`	On circle graphs with girth at least five. Electron. Notes Discret. Math. Louis Esperet, Pascal Ochem
2007	J	`jnl`	Oriented colorings of 2-outerplanar graphs. Inf. Process. Lett. Louis Esperet, Pascal Ochem
2007	J	`jnl`	Oriented vertex and arc colorings of partial 2-trees. Electron. Notes Discret. Math. Pascal Ochem, Alexandre Pinlou
2007	A*	`conf`	Planar graphs are in 1-STRING. SODA Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
2006	J	`jnl`	A generator of morphisms for infinite words. RAIRO Theor. Informatics Appl. Pascal Ochem
2006	J	`jnl`	On the acyclic choosability of graphs. J. Graph Theory Mickaël Montassier, Pascal Ochem, André Raspaud
2005	J	`jnl`	A generalization of repetition threshold. Theor. Comput. Sci. Lucian Ilie, Pascal Ochem, Jeffrey O. Shallit
2005	J	`jnl`	On some arboricities in planar graphs. Electron. Notes Discret. Math. Daniel Gonçalves, Pascal Ochem
2004	B	`conf`	A Generalization of Repetition Threshold. MFCS Lucian Ilie, Pascal Ochem, Jeffrey O. Shallit
2004	J	`jnl`	On the interval number of special graphs. J. Graph Theory József Balogh, Pascal Ochem, András Pluhár
2004	J	`jnl`	Oriented colorings of triangle-free planar graphs. Inf. Process. Lett. Pascal Ochem
2003	J	`jnl`	How Many Square Occurrences Must a Binary Sequence Contain? Electron. J. Comb. Gregory Kucherov, Pascal Ochem, Michaël Rao

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.