A. J. W. Duijvestijn

12 papers Journal 10Unranked 1
YearRankTypeTitle / Venue / Authors
1996 J jnl
Simple perfect squared squares and 2 * 1 squared rectangles of order 26.
Math. Comput.
A. J. W. Duijvestijn
1996 J jnl
The number of polyhedral (3-connected planar) graphs.
Math. Comput.
A. J. W. Duijvestijn
1993 J jnl
Generating all 3-connected 4-regular planar graphs from the octahedron graph.
J. Graph Theory
Haitze J. Broersma, A. J. W. Duijvestijn, F. Göbel
1993 J jnl
Simple Perfect Squared Squares and 2 × 1 Squared Rectangles of Orders 21 to 24.
J. Comb. Theory B
A. J. W. Duijvestijn
1985 J jnl
Decomposition of select expressions.
Inf. Syst.
Gerrit A. Blaauw, A. J. W. Duijvestijn, F. Nieuwerth
1983 J jnl
Optimization of Relational Expressions Using a Logical Analogon.
IBM J. Res. Dev.
Gerrit A. Blaauw, A. J. W. Duijvestijn, R. A. M. Hartmann
1983 J jnl
Simple perfect square-cylinders of low order.
J. Comb. Theory B
A. Augusteijn, A. J. W. Duijvestijn
1981 — ed.
Trends in Information Processing Systems, 3rd Conference of the European Cooperation in Informatics, Munich, Germany, October 20-22, 1981, Proceedings
ECI
A. J. W. Duijvestijn, Peter C. Lockemann
1979 J jnl
A lowest order simple perfect 2 × 1 squared rectangle.
J. Comb. Theory B
A. J. W. Duijvestijn
1978 J jnl
Simple perfect squared square of lowest order.
J. Comb. Theory B
A. J. W. Duijvestijn
1968 — conf
The economics of program production.
IFIP Congress (2)
A. J. W. Duijvestijn
1959 J jnl
On the Transition from Superconducting to Normal Phase, Accounting for Latent Heat and Eddy Currents.
IBM J. Res. Dev.
A. J. W. Duijvestijn
2025 Best paper conf
Assessing the Effectiveness of the Tigress Obfuscator Against MOPSA and BinaryNinja.
CheckMATE
Nicolò Altamura, Enrico Bragastini, Marco Campion, Mila Dalla Preda
2026 Best paper preprint
ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage.
arXiv
Chang Liu, Noah Fleischmann, Nicolò Altamura, Edward Raff, James Holt, Kristopher Micinski