default search action

combined dblp search
author search
venue search
publication search

ask others

Vasile Mihai

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2000 – 2009

see FAQ

What is the meaning of the colors in the publication lists?

2009
[j11]
- view
  - electronic edition @ jstor.org
  - details & citations
- export record
  dblp key:
  - journals/tamm/Mihai09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tamm/Mihai09
Vasile Mihai:
Problem 11419. Am. Math. Mon. 116(3): 276 (2009)
2008
[j10]
- view
  - electronic edition @ jstor.org
  - details & citations
- export record
  dblp key:
  - journals/tamm/MihaiH08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tamm/MihaiH08
Vasile Mihai, Sin Hitotumatu:
The Euler Line after All: 11272. Am. Math. Mon. 115(6): 573-574 (2008)
2007
[j9]
- view
  - electronic edition @ jstor.org
  - details & citations
- export record
  dblp key:
  - journals/tamm/Mihai07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tamm/Mihai07
Vasile Mihai:
Problem 11272. Am. Math. Mon. 114(2): 164 (2007)
2006
[j8]
- view
  - electronic edition @ jstor.org
  - details & citations
- export record
  dblp key:
  - journals/tamm/MihaiL06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tamm/MihaiL06
Vasile Mihai, O. P. Lossers:
Trapezoid Inscribed in Ellipse: 11095. Am. Math. Mon. 113(3): 269 (2006)
2005
[j7]
- view
  - electronic edition @ jstor.org
  - details & citations
- export record
  dblp key:
  - journals/tamm/MihaiV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tamm/MihaiV05
Vasile Mihai, Zoltán Vörös:
One of the Morley Triangles: 11049. Am. Math. Mon. 112(7): 660-661 (2005)
2004
[j6]
- view
  - electronic edition @ jstor.org
  - details & citations
- export record
  dblp key:
  - journals/tamm/Mihai04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tamm/Mihai04
Vasile Mihai:
Problem 11095. Am. Math. Mon. 111(6): 535 (2004)
2003
[j5]
- view
  - electronic edition @ jstor.org
  - details & citations
- export record
  dblp key:
  - journals/tamm/MihaiZ03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tamm/MihaiZ03
Vasile Mihai, Li Zhou:
A Tetrahedron with All Faces Congruent: 10934. Am. Math. Mon. 110(9): 846-847 (2003)
[j4]
- view
  - electronic edition @ jstor.org
  - details & citations
- export record
  dblp key:
  - journals/tamm/Mihai03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tamm/Mihai03
Vasile Mihai:
Problem 11049. Am. Math. Mon. 110(10): 956 (2003)
2002
[j3]
- view
  - electronic edition @ jstor.org
  - details & citations
- export record
  dblp key:
  - journals/tamm/Mihai02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tamm/Mihai02
Vasile Mihai:
Problem 10934. Am. Math. Mon. 109(3): 299 (2002)
2001
[j2]
- view
  - electronic edition @ jstor.org
  - details & citations
- export record
  dblp key:
  - journals/tamm/MihaiW01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tamm/MihaiW01
Vasile Mihai, Michael Woltermann:
The Smoothest and Roughest Permutations: 10725. Am. Math. Mon. 108(3): 272-273 (2001)
2000
[j1]
- view
  - electronic edition @ jstor.org
  - details & citations
- export record
  dblp key:
  - journals/tamm/KimberlingYM00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tamm/KimberlingYM00
Clark Kimberling, Peter Yff, Vasile Mihai:
Another Set of Concurrent Cevians: 10678. Am. Math. Mon. 107(4): 373 (2000)

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.