Andrew Solomon

According to our database1, Andrew Solomon authored at least 11 papers between 1998 and 2012.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Computing the variance of tour costs over the solution space of the TSP in polynomial time.
Comput. Optim. Appl., 2012

2009
Quasiabelian landscapes of the traveling salesman problem are elementary.
Discret. Optim., 2009

2007
Linuxgym: software to automate formative assessment of unix command-line and scripting skills.
Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2007

2006
Pushout: A Mathematical Model of Architectural Merger.
Proceedings of the Perspectives of Systems Informatics, 2006

2004
Architectural Abstraction as Transformation of Poset Labelled Graphs.
J. Univers. Comput. Sci., 2004

2003
Weakly symmetric graphs, elementary landscapes, and the TSP.
Appl. Math. Lett., 2003

The theory of elementary landscapes.
Appl. Math. Lett., 2003

Sorting Circular Permutations by Reversal. .
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Distributed Computing for Conglomerate Mathematical Systems.
Proceedings of the Algebra, Geometry, and Software Systems [outcome of a Dagstuhl seminar], 2003

Applying NAILS to Blackboard.
Proceedings of the Fifth Australasian Computing Education Conference (ACE 2003), 2003

1998
Concrete Monoids, Automata and the Catalan Construction.
Electronic Notes in Theoretical Computer Science 12, Elsevier, 1998


  Loading...